In brief, how does the alpha$-$beta pruning algorithm accomplish potentially exploring deeper down the tree in the same amount of time

Group of answer choices

Alpha$-$beta pruning will always provide a better move than mini$-$max since the underlying assumptions of alpha$-$beta pruning guarantee a higher$-$quality base tree.

Since alpha$-$beta pruning is a complete and optimal algorithm, it is applicable to a wider variety of situations than standard minimax.

Alpha$-$beta pruning can potentially explore deeper in the tree by pruning unnecessary branches of the tree.