1. Suppose $u = f(x,y)$ where $x = g(s,t)$ and $y = h(s,t)$. A tree diagram for this scenario has how many total paths from $s$ to $u$?
- A.One
- B.Two
- C.Four
- D.It depends on the specific form of $f$, $g$, and $h$.
View Answer
Answer: Two
Trace paths through the tree: From $s$, there are branches to $x$ and $y$ (since both depend on $s$). From $x$ and $y$, there is one branch each to $u$. Total paths: $s \to x \to u$ and $s \to y \to u$, giving two paths. Why the correct answer works: The tree diagram has exactly two paths from $s$ to $u$, corresponding to the two terms in $\frac{\partial u}{\partial s}$. Why distractors fail: Option A miscounts. Option C counts all paths in the diagram (including those through $t$), not just those through $s$. Option D is wrong because the structure is determined by the dependency relationships, not the specific formulas.