Problem 4. Alpha-Beta pruning [15 points] Below is the tree showing the states in a 2-player game played by two rational agents. This tree shows the 2-level expansion of decisions, and the values at the leaves are the utility values at those states. A) Show the values of every intermediate node after performing the minimax algorithm. ( 5 points) B) Use the Alpha-Beta pruning algorithm to determine the branches that need to be cut. (8 points) C) For a general game tree (i.e., not limited to the above tree), are there any cases that the AlphaBeta algorithm gives a different value at the root node than the Minimax algorithm? If yes, show an example; if no, just say no. (2 points)