(i) Mark the terminal nodes in the game tree you drew for Question A.1 with their utility values, using +1 to indicate a win for A (MAX), and -1 to indicate a win for B (MIN).
(ii) Annotate each of the nodes in the tree with its backed-up minimax value.
(iii) Circle the nodes that would be pruned by alpha-beta pruning using depth-first (left-to-right) search. (You should assume that the alpha values are initialized to -1, rather than -infinity, and that the beta values are initialized to +1, rather than +infinity.