3 Adversarial Search In the following minimax game tree, A represent maximizing nodes and represent mini- mizing nodes while nodes represent static evaluations of the states. Note that these values are not known to the search algorithm until it visits and explicitly evaluates the state. For the purposes of this question, the nodes in the tree should be processed from left to right. You may ignore the double slash (// pruned branch labeled "A" until part c. (a) (5 points) Let = 2 in the static evaluation node containing the variable in the tree. Fill in the nodes in the tree with the correct values selected by the maximizing and minimizing players during the minimax algorithm. (b) (5 points) Let I = 2 in the static evaluation node containing the variable in the tree. Apply alpha-beta pruning to the tree. Specifically, mark the appropriate edges in the tree with a double slash (//) to indicate which nodes were pruned using the algorithm. (c) (5 points) What is the smallest value of c where branch A is pruned using alpha-beta