Part 1 Adversarial Search (Points 3) MAX MIN MAX (16) 12 MIN 10 5) (10) a) Compute the minimax value at each node for the game tree above. Copy the above tree into your answer sheet and show the value of each node. (1 Point) b) Use the Alpha-Beta pruning algorithm to prune the game tree above. You should draw an X through any pruning edge(s). Assume nodes are expanded left to right. Show all alpha and beta values computed at each node. Copy the above tree into your answer sheet and write down all alpha and beta value clearly. Submission should be well organized to clearly see each value. (2 Points) NOTE: Use the minimax algorithm and the Alpha-Beta pruning algorithm that we discussed in the class to solve the above two problems respectively