Consider this game tree where the root is a maximizing node, and children are visited left to right. (a) Compute the minimax game value of nodes A,B,C, and D using the standard minimax algorithm. (2 marks) (b) What move will be selected by player one using minimax? (1 mark) (c) List the nodes (leaves or interior nodes) that alpha-beta algorithm prunes (i.e., decides need not be examined). (2 marks) (d) The number of nodes that alpha-beta algorithm prunes depends on how each node's children are ordered in the tree. How to obtain a new game tree by re-ordering the children of each internal node, such that the new game tree is equivalent to the tree above, but alpha-beta pruning will prune as many nodes as possible? List the nodes that would be pruned