Problem 3: Consider the following game tree in which the evaluation function values are shown below each leaf node. Assume that the root node corresponds to the maximizing player and the search always visits children left-to-right. Apply alpha-beta puruning algorithm on the given tree. Cross the branches which will be pruned on the tree. Make sure that there is no shifting on your crosses before you send the tree. (15 points) MAX MIN MAX MIN 2 3 2 101 2 12