(iii) Consider the alternative game tree shown below. The task here is to illustrate how you might apply alpha-beta pruning with progressive deepening and dynamic move ordering (i.e., best first strategy) in this case. The value shown next to each node of the tree is the respective node's static-evaluation value returned for that depth limit. -9 -6 G -7 H 3 ? -3 -3 4 4 K 6 M 7 5 6 max d) What board states/nodes (if any) are not evaluated here? min a) Redraw the tree to show what changes at each depth iteration where you apply alpha- beta followed by the move-ordering step. Note: You must cover depth iterations 1 & 2 and show what the tree looks like after sorting, but before searching to depth 3. b) Specify the order in which the board positions/nodes A, B, C and D in the game tree above are evaluated at depth 1. c) Should time run out before the algorithm advances to depth 3 what value will be returned for MAX at the root of the game tree?