This question considers pruning in games with chance nodes. Figure trivialchancegamefigure shows the complete game tree for a trivial game. Assume that the leaf nodes are to be evaluated in lefttoright order, and that before a leaf node is evaluated, we know nothing about its value—the range of possible values is $\infty$ to $\infty$.

Copy the figure, mark the value of all the internal nodes, and indicate the best move at the root with an arrow.

Given the values of the first six leaves, do we need to evaluate the seventh and eighth leaves? Given the values of the first seven leaves, do we need to evaluate the eighth leaf? Explain your answers.

Suppose the leaf node values are known to lie between –2 and 2 inclusive. After the first two leaves are evaluated, what is the value range for the lefthand chance node?

Circle all the leaves that need not be evaluated under the assumption in (c).