5. Let be a two-player game described by the two-layer game tree of Figure 2. At node A the next player is player MAX and at nodes B, C and D

the next player is player MIN. The figure shows the values of the utility function for the terminal nodes. Recall that the MAX player seeks to drive the game to a terminal node with the largest possible value of the utility function, and the MIN player seeks to drive the game to a terminal node with the smallest possible value of the utility function. A) Determine the MINIMAX values corresponding to nodes A,B,C,D. B) Determine the optimal choice of player MAX at node A, according to the MINIMAX search algorithm C) Explain which parts of the tree are pruned by the alpha beta search algorithm and why. MAX MIN 5 6 d₁ 4 8 00 2 9 3 3 d₂ 2 dy 1