Please help solve this. This is a question on game theory.

Additional Problem: In the following game, (a) find player 1's security strategy and security payoff; (b) show that her security strategy is strictly dominated; and (c) find her maxmin strategy and maxmin payoff. Then, (d) argue that in any game, a maxmin strategy is not strictly dominated. X Y 01 A 10, 0, . P B 0, . 10, . r 1, 1, . 1-p-r