In a badminton tournament of $n$ players, each player plays exactly one match against every other player. There are no draws. Prove via induction that the players can be arranged in an order $p_1, p_2, \dots, p_n$ such that $p_i$ defeats $p_{i+1}$ for all $i \in 1, 2, \dots, n - 1$.