4. Consider the following game matrix of payoffs: L M R 1,1 5,4 4,6 m 4,7 0,2 3,1 b 2,0 2,12 3,0 a) Find the pure strategy Nash Equilibria for the above game, assuming that it is a simultaneous move game. b) Suppose Column moves first, and Row moves sequentially after that. Draw a game tree and solve for the equilibrium path. Would Column want to move first? Would Row want to let them? c) Answer the same questions in (b) above, only assuming that Row would move first! Would Row want to do so? Would Column want to allow them to move first? Explain