Solve the questions below using the above MINIMAX game tree.

Note that MAX always takes the first turn. Thus, in this case, A is a MAX node, and B, C, and D are MIN nodes. TA, ..., and TR are terminal nodes.

a) Use MINIMAX search and figure out the values at each node. (i.e., A = 10, B = 20, etc)

b) Use alpha-beta pruning and figure out what edges can be pruned. Here, you are examining the tree from left to right. You must specify all nodes that can be pruned, and state every node that would be omitted, including all the children nodes (no need to worry about the order).