please

1. [10 points] Consider the following zero-sum game tree. The choices for the maximizing player are shown with triangles that point up, e.g., the root node, and the choices for the minimizing player are shown with triangles that point down. The bottom nodes represent the terminal utilities. Figure Description 1: A game tree to calculate minimax. As usual max nodes are triangles, min nodes inverted triangles. Utilities are illustrated on the leaves. A. [5 points] List the minimax values of each node, assuming both players act optimally. I. Root node: II. 2nd layer (from left to right): B. [5 points] List the pruned node(s) (using their values) from the game tree above through alphabeta pruning. Explain the reason if no nodes can be pruned. Assume the search goes from left to right; when choosing which child to visit first, choose the left-most unvisited child