(b) Now, represent this game in a game tree. Solve for the Nash equilbria of the game by backward induction. These are the subgame perfect equilibria of the game, i.e. equilibria in which players' actions are optimal in every subgame. Notice ( N, W) is not a subgame perfect equilibrium because backward induction ensures that actions taken in equilibrium are optimal in every subgame, even those that aren't reached in equilibrium. Suppose that with probability , Mr. Entrant makes a mistake and selects E when he intends to play NV (with probability 1 - , / is played as intended). Show that for all > 0, (N, W) is not an equilibrium