Show all calculations, explain all answers (up to 5 lines), and fully label graphs. Also: (a) staple sheets, (b) acknowledge assistance, (c) highlight final answers, and (d) write neatly! 1. Consider the following game: L C R U 2, 2 6, 1 1, 1 M 1 , 6 5 , 5 1 , 1 D 1, 1 1, 1 4, 4 a) If the game is played once, what are the pure strategy Nash Equilibria? b) If the game is played twice, and the results of the first stage is known before the second stage begins, how many strategies does each player have? c) Can the payoff (5,5) be achieved in the first stage of a subgame perfect Nash Equilibria? If yes, find strategies that do so. If not, prove why not