Consider a simple two-player chess in which the firstmover can choose among 5 possible actions. The secondmover, regardless of the first movers actions choice, has 10 available action choices. Then the first-mover moves again by choosing among 7 possible actions. After the first-mover's second move, the game is over. (To make this a well-specified game, we need payoffs but for our purpose the exact specification of payoff is irrelevant.) How many strategies does the first-mover have