Node A is a maximizing node for the first player, while nodes B, C, and D are minimizing nodes for the second player. The possible moves from node A are a1, a2, and a3, and the utility values for the maximizing player are shown at the leaf nodes. To determine the minimax value and optimal move for the first player at node A, we apply the minimax algorithm to the game tree.

1. Consider the game tree for a two-player game shown in the figure below. Node "A" is a
maximizing node whereas nodes "B", "C", and "D" are minimizing nodes. The possible moves
for the maximizing player at the root node are labeled a 1 , a 2 , and a 3 . The possible replies to
a1 for the minimizing player are b1, b2, b3, and so on. The leaf nodes show the utility value for
the maximizing player (i.e. the evaluation function). Based on applying the minimax algorithm
on this search tree, determine (i) the minimax value for the maximizing player at node "A" and
(ii) the optimal move for the maximizing player at node "A". Show your work/calculations
where appropriate.