1. Game Tree Search (3 parts, 40 points total). Consider this game tree: MAX MIN MAX a) (10 points) Minimax. Simulate the behavior of the minimax algorithm on the above game tree. b) (20 points) Alpha-Beta Pruning. Simulate the behavior of minimax with alpha-beta (a-P) pruning on the above game tree. Show your work mark the pruned branche by crossing them out, indicate which values are a and which are B. and number the static evaluations and all value updates and inequality tests versus a and B. in order c) (10 points). Explain your own words what a and B stand for with respect to a value v. Use an illustration as needed