The following is a two-player, single-move, simultaneous game in normal form: Player 1 (Row)/ A B C Player 2 (Column) A (25,25) (70,36) (35,36) B (36,70) (50,50 (35,30) C (36,35) (30,35) (60,60) a) Find all Nash equilibria (pure or mixed) in the game and list the outcome(s) and payoff(s). Which approaches work to solve the game? b) Draw the game in extensive form. c) Convert the game to be sequential, with Player 1 moving first, and find any subgame perfect Nash equilibria in the game and list the outcome(s) and payoff(s). d) Are the answers to parts a and c the same? If not, which part gives a higher joint payoff and why