Algorithm

Problem 3: Consider the game tree shown below. Assume the top node is a max node. The labels on the ares are the moves. The numbers in the bottom layer are the values of the different outcomes of the game to the max player. Max Min R L Max 25 3 04012 1. What is the value of the game to the max player? 2. What first move should the max player make? 3. Assuming the max player makes that move, what is the best next move for the min player, wsuming that this is the entire game tree? Problem 4: In the following game tree, are there any alpha-beta cutoffs Max Min 2) (6 8 Max 1. Consider the nodes from left to right, which nodes are cutolt? 2. Consider the nodes from right to left, which nodes are cutoft