Consider the following search tree for a 2-person game. The numbers next to the leaf nodes are static evaluations. Hand-simulate the minimax search that would be carried out, assuming the first player is the maximizing player, and that nodes are  searched recursively from left to right using the Alpha-Beta algorithm. Use your simulation to determine which move the first player should make in order to play optimally.  To play optimally, the first player should move to state [ Select ] L C W B D . The evaluation of this state is [ Select ] 0 12 7 15 14 . The Beta value for this state is [ Select ] positive infinity negative infinity 12 7 . Within the search, the first nodes to be evaluated make up the [ Select ] third level second level first level of the tree. The evaluation that they receive is [ Select ] cutoff dynamic static thresholded .  When evaluating a node representing the opponent's choice of move, the evaluation is derived from the [ Select ] cutoff first minimum maximum last evaluation at the level below.  多重下拉选择题