5.16 This question considers pruning in games with chunce nodes. Figure 5.19 shows the complete game tre for a trivial game. Assume that the leaf nodes are to be evaluated in leftto-tight ordec, and that before a leaf node is evaluated, we know nothing about its value-the nenge of possible values is to . a. Copy the figure, mark the value of all the intemal nodes, and indicate the best move at the roo with an arrow, b. Given the values of the fiss six leaves, do we need to evaluate the seventh and eighth leaves? Given the values of the fint seven leaves, do we need to evaluate the eighth leaf Explain your answers. c. Suppose the leaf node values are known to lie between -2 and 2 inclusive. After the fins two lewes antevaloated, what is the value nango for the lefthand chance node? d. Cincle all the leaves that noed not be evaluated under the asuingtion in (c)