The mini$-$max algorithm makes five strong assumptions of the game being played. What are they? Select all that apply.

Group of answer choices

The game is a two$-$player game.

The game has a non$-$zero sum.

Perfect Information

No winner.

Players are optimal.

Players take turns.

Rational Opponents

The game is zero$-$sum.