3. Consider the following game tree representing a game in which player 1 moves first. If player 1 chooses Out the game ends. If player 1 chooses In, then player 2 chooses between A, B, and C. If player 2 chooses C the game ends. If player 2 chooses A or B, player 3, whithout observing the choice of player 2 chooses between X and Y. X 4,3,2 A Y *6,1,1 X 2. B .2,3,7 In Y -8,6,6 1 C *. 5,4,2 Out . 3,3,3 (a) List the strategies available to each player. (b) Find all the pure-strategy Nash equilibria. (c) Find all pure-strategy subgame perfect Nash equilibria