(Solved): Given the following game tree and assuming that MAX makes the first move, use the Minimax search a ...

Given the following game tree and assuming that MAX makes the first move, use the Minimax search algorithm complete the following tasks. 1. Find the move that results in the best utility. 2. Show the value of MINIMAX at each node, including at the root. Given the following game tree and assuming that MAX makes the first move, use the Alpha-Beta pruning algorithm to: 1. Find the moves of MAX that result in the best utility. 2. Show the values of MINIMAX, alpha and beta at each node that is explored, including at the root. 3. Indicate the cutoff points, i.e., the parts of the tree that are not searched. Assume that the at the same level, we the ordering of the moves is from the left to right on the game tree. NOTE: For extra practice, you can do this exercise using Minimax, without Alpha-Beta pruning.