The alpha$-$beta pruning algorithm can effectively prune the search space so as to look twice as

far ahead as the minimax algorithm. What is the best case situation that allows this. Assume that

max plays, then min, then max then min. Select all that apply

When max has control of the game tree the largest evaluation function value is the first child

When max has control of the game tree the smallest evaluation function value is the first child

When min has control of the game tree the smallest evaluation function value is the first child

When min has control of the game tree the largest evaluation function value is the first child