Question 5 [25 pt]: Consider the zero-sum game tree shown below. The triangles that point up represent MAX players and triangles which point down represent MIN players. Assume that each player plays optimal and carry out the minimax algorithm. 1. What are the values of all the nodes (A, B,., M)? 2. Let's apply alpha-beta pruning algorithm on this game tree. The search goes from left to right: If you have to visit the next child node, the leftmost unvisited child node is chosen. (a) Which leaf nodes won't be visited? (b) What are the values of all the nodes (A, B, .. ,M) when we apply alpha-beta pruning algorithm? (assume MIN nodes start with value oo and MAX nodes start with value-oo), (c) what are the and values at each node