Why is alpha$-$beta pruning effective in the evaluation of game trees in two$-$player zero$-$sum games?

Select one:

It reduces the number of nodes evaluated by eliminating branches that cannot affect the final decision.

It extends the search depth uniformly for all branches.

It enhances the accuracy of the final score calculation.

It calculates the exact probability of winning for each player.

It allows players to revise their strategies based on the opponent's moves.