Consider the following search tree for a 2-person game and assume that the first player is the maximizing player. The numbers underneath the leaf nodes are static evaluation results. A K D C | H G B FL E Assuming the nodes are being searched recursively from left to right using the Alpha-Beta algorithm, which move should the first player make from A to play optimally? Provide relevant details on how the search will proceed to justify your answer. Y X WVUTSR Q PON ML 12 11 14 13 6 9 15 10 7 6 14 3 11 1