Problem 6 (10 points): Consider the following game tree, where the first move is made by the MAX player and the second move is made by the MIN player. (a) What is the best move for the MAX player using the minimax procedure? (b) Perform a left-to-right (left branch first, then right branch) alpha-beta pruning on the tree. That is, draw only the parts of the tree that are visited and don't draw branches that are cut off (no need to show the alpha or beta values). (c) Do the same thing as in the previous question, but with a right-to-left ordering of the actions. Discuss why different pruning occurs. 4 0