30. In a round-robin tournament, every team plays every other team exactly once, with a winner of each game (no ties). Use induction on the number of teams to prove that in any tournament, there exists a team t such that, for every other team u, t either beats u or beats a team that beats u