1. Consider a two player, simultaneous move game. The strategies available to each player and payoffs are shown in the following matrix form: Player 2 a) Find and write down the Nash equilibria in pure strategies, if any exist. b) Say that instead of being a simultaneous move game this game had been sequential. First player 1 will choose a strategy and then player 2 will observe the choice made by player 1 and choose a strategy. The full structure of the game, including all payoffs, is common knowledge to both players. Sketch a game tree to represent the extensive form of this game. Find and write down the subgame perfect Nash equilibria