Answer the following questions a) Analyze why pruning can improve search efficiency compared to minimax algorithm in a two-person games. [2m] The benefit of alpha-beta pruning lies in the fact that pf the search tree can be . . This way, the search time can be limited to the more promising subtree, and a optimization reduces the effective depth to slightly more than half that of simple minimax if the nodes are evaluated in an optimal or near optimal order search can be performed in the time. The b) Consider the game tree in the figure below. Perform a left to right alpha beta pruning on the tree. Compare and point out all parts of the tree that are pruned. [am] max D G 6 5 3 2 4 91 7983 5 2 2 5 9 7 9 4 2 5 Your Answers B: c D: E: F: G