Which of the following statement is TRUE related to Alpha Beta pruning algorithm?

Why this is correct:
In alpha–beta pruning, alpha represents the best (highest) value that the maximizing player can guarantee so far (a lower bound), and beta represents the best (lowest) value that the minimizing player can guarantee so far (an upper bound). So alpha is associated with maximum (maximizer’s best) and beta with minimum (minimizer’s best). Alpha–beta prunes branches that cannot affect these bounds. Why the others are wrong: 1.      Alpha–beta does not explore all paths — it prunes branches that cannot improve the outcome. 2.      Minimax is the base algorithm; alpha–beta is an optimization of minimax (so the statement that minimax is a better implementation of alpha–beta is backwards). 3.      This reverses the roles of alpha and beta.