Player MAX and player MIN are playing a zero$-$sum game with a finite number of possible moves.

MAX calculates the minimax value of the root to be

$$

M$.$ You may assume that at every turn,

each player has at least $2$ possible actions. You may also assume that a different sequence

of moves will always lead to a different score $($i$.$e$.,$ no two terminal nodes have the same score$).$

Which of the following statements are true?