The question is associated with game theory

QUESTION 9 Suppose that a 2 X 2 game (with players 1 and 2) is such that it has exactly zero NEPS. For any such game: IQ None of the players has a strictly dominant strategy. 0 It is possible that at least one player has a strictly dominant strategy. Consider a simultaneous 2 x 2 game: Player A's possible actions are up (U) and down (D), and player B's possible actions are left (L) and right (R). The game is such that for each combination of actions, the sum of the players' payoffs (for that combination) equals 1. Players' payoffs may take any value, including positive, negative, and zero values-provided that for each combination of actions, the sum of the associated payoffs equals 1. As an illustrative example, consider a game such that for the combination of actions (U, L), player A receives a payoff of 4 and player B receives a payoff of -3; and for the combination of actions (D, L), player A receives a payoff of 1 and player B receives a payoff of O. In this example, for (U, L), the sum of the payoffs is 4 + -3 = 1; for (D, L), the sum of the payoffs is 1 + 0 = 1. Choose the correct answer among the options below: O Any such game will have at least one NEPS. O It is possible for such a game to have zero NEPS.Suppose that a: is an integer (that may be negative, zero, or positive). For the following game, select the correct answer among the choices below. Player 2 E It is possible for such a game to have two NEPS. Q It is not possible for such a game to have two NEPS.