Problem 3: Consider the following game trees. The root is a maximizing node, and children are visited left to right, use the tree to answer the following questions: [15 points] a) Circle all the nodes, or state that none exist, those are not visited by alpha- beta pruning and find the solution path(s). [5 points] b) Find the solution path(s) using alpha-beta search. [1 points] 5 8 3 1 20 6 2 12 125 22 27 40 50 30 31