3) (30 points) (a) Using the minimax heuristic on the following game tree. Show the min and max values at each node. (b) Perform an alpha-beta pruning on the following tree. Show the direction you are taking, the alpha and beta values at each appropriate place, and exactly where all pruning takes place. You are playing the top node and want to win. Heuristics values are at leaf nodes. (e) Do the similar alpha-beta pruning on the following tree from most right to left. Min Layer 8 10 5 9 6 8 3 6 56 4 528 45 7 3 5 9 4 9 6 7 10 8 7