Problem 3 [20 points]. Consider the game search tree given in the figure below. MAX 12 23 24 12 2125 2 26 11 144 10 8 9 a. [8 points Apply MinMax (minimax) algorithm to the game tree. Write down the intermediate values at the nodes. What is the best sequence of moves at the max node a (a path along the tree)? What is the utility? b. [12 points Apply MinMax with alpha-beta pruning in left-to-right order. Write down all nodes that are visited in the order they are visited. Here. by "visited", we mean the first time a node is seen by the algorithm. Whenever truncation is applied, i.e., when part of the tree is skipped, provide the node where this is happening and explain why the truncation is applied. In particular, write down the values of and at this point