Use the MiniMax algorithm with Alpha-Beta pruning studied in class to show which branches of the following search tree will be pruned, also mark the path that Max will take (best move). The search tree is shown below. Show the alpha and beta values for all nodes during your solution. Solve the question on paper, then submit your solution as an image or pdf file on the space provided. Good Luck! GE- OG B = 0 Max Min E F Max 2 3 5 9 0 1 1 7 5 Terminal node