Q3: Consider the game tree shown below. The top node is a max node. The labels on the arcs are the moves. The numbers in the bottom layer are the values of the different outcomes of the game to the max player. (15 points) Max Min Max M LR LR 2 3 1 2 R 1- Label each non-leaf node with its minimax value. (4) 2- What is the value of the game to the max player? (2) L R 4 6 3- What first move should the max player make? (2) 4- Assuming the max player makes that move, what is the best next move for the min player, assuming that this is the entire game tree? (2) 5- Using alpha-beta pruning, consider the nodes from right to left, which nodes are cut off? Circle the nodes that are not examined? (5)