use the previous problem to prove the following with induction. for n ∈ nand every tournament with n players, there exists a win-sequence x1, . . . , xn that includes each of the n players in the tournament exactly once. hint: if we remove a player from a tournament with at least two players, then we get a tournament with n −1 players.
