solve the question in details

The tree in Figure I models the actions of two opposing players, Min and Max. Each node represents a state of the game. The leaves correspond to the terminal states. The value of these states is indicated I. Simulate the alpha-beta pruning algorithm using a left-to-right visit order. a. Line the pruned arc (s) with a line; b. Indicate the value returned by the algorithm inside each visited node; c. Circle the action returned by the algorithm. Min M ax Min 16 +2 10 Figure I Would it be more efficient to visit the successor nodes from right to left? Justi$' your answer,