PLEASE READ THE QUESTION CAREFULLY. I POSTED THIS QUESTION EARLIER AND SOME IDIOT WROTE C++ Code.

Question 4: CLO-3 (8 pts) (Adversarial Search) Given the search tree shown below MAX MIN 3 MAX 6 (4 3) (5)(2 6 (9 2) (1) (10 (8) 20 a) Fill in the squares and circles with the backed-up values resulting from a regular minimax search. (4) b) Show how a depth-first search with alpha-beta pruning would work, indicating all a and B values by drawing a line through the unexplored/pruned branches. As usual, assume that children are explored from left to right. (4)