2. (10 points) Apply Alpha-Beta pruning to the following game tree. It is the maximizer's move. The leaves of the tree are the static evaluations. 1. Label each internal node with the alpha, beta value sent to it. Such as the / values /+ besides the root node. 2. Label the parent are of each internal node with the value that node returns. State the decision at the root node (which branch to take). 3. Underline each leaf node that is evaluated. Draw a line through branches that are pruned