Find two pure strategy NE and one mixed strategy NE for the simultaneous-move subgame (the matrix), together with the NE ayoff. | For each pure strategy Nash equilibrium you found in question a, do backward induction for a SPNE of the game tree. Put down the SPNE you found, together with the SPNE payoffs. Based on the mixed strategy NE you found in question a, do backward induction for a SPNE of the game tree. Put down the SPNE and the payoff. C 3,1 a d 1,6 1 e 2,3 b 2 f 112 L R U 4,4 0,2 3,1 2, 2 Find two pure strategy NE and one mixed strategy NE for the simultaneous-move subgame (the matrix), together with the NE ayoff. | For each pure strategy Nash equilibrium you found in question a, do backward induction for a SPNE of the game tree. Put down the SPNE you found, together with the SPNE payoffs. Based on the mixed strategy NE you found in question a, do backward induction for a SPNE of the game tree. Put down the SPNE and the payoff. C 3,1 a d 1,6 1 e 2,3 b 2 f 112 L R U 4,4 0,2 3,1 2, 2 Find two pure strategy NE and one mixed strategy NE for the simultaneous-move subgame (the matrix), together with the NE ayoff. | For each pure strategy Nash equilibrium you found in question a, do backward induction for a SPNE of the game tree. Put down the SPNE you found, together with the SPNE payoffs. Based on the mixed strategy NE you found in question a, do backward induction for a SPNE of the game tree. Put down the SPNE and the payoff. C 3,1 a d 1,6 1 e 2,3 b 2 f 112 L R U 4,4 0,2 3,1 2, 2