Consider the zero-sum game tree shown below. Triangles that point up, such as at the top node (root), represent 1 Choices for the maximizing player; triangles that point down represent 2 Choices for the minimizing player. Outcome values for the maximizing player are listed for each leaf node, represented by the values in squares at the bottom of the tree. Assuming both players act optimally, carry out the minimax search algorithm. Enter the values for the letter nodes in the boxes below the tree.

Input Answers Here and explain A: ? B: ? C: ? D: ?