Player 1 Consider the payoff matrix above: and answer the following questions about this game; a] Suppose x = 2 and y = 4. After all strategies that are dominated by a pure strategy are iteratively deleted for both players, hoyur many strategies remain for Player 1? 2 1/ One possible correct answer is: 2 b] Suppose x = 2 and y = 4. After all strategies that are dominated by a pure strategy are iteratively deleted for both players' how many strategies remain for Player 2? 3 if One possible correct answer is: 3 c} Suppose x = 2 and y = 4. What is the sum of both players' payoffs in all pure strategy Nash equilibria of the game? 8 X f) Suppose x = 2 and y = 11. What is the sum of both players' payoffs in all pure strategy Nash equilibria of the game? 15 X One possible correct answer is: 33