2. Consider the following game tree: MAX MIN MAX 000000000000000000 a) (4 points) Apply the Minimax algorithm and fill in the appropriate values at each node on the tree above. b) (1 point) Which action should Player 1 choose: A, B, or C? c) (5 points) Apply alpha-beta pruning. Redraw the tree and indicate using "//" which branches would not be explored