Question 2 (20 pts): Using the following figure 2, use a - pruning to (1) assign utility values for each internal node (i.e., non-leaf node) and indicate which path is the optimal solution for the MAX node at the root of the tree. (2) For each node, indicate the final a and B values. (Note that initial values at the root are a = -00, B = 00.) (3) For each cut that happens, draw a line to cross out that subtree. to VADOV VWVVVV AA AA Figure 2: Game Tree. Solve using a - pruning. This tree is the same as figure 1