Consider the following game tree. The root is a maximizing node, and children are visited left to right. [6 points] MAX MIN 23 21 20 32 34 35 40 50 60 a) Circle all the nodes or state that none exist, that are not visited by alpha-beta pruning. 12 points) b) Draw 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 [4 points) Maximum site for now files OMR