Chapter 5.3, Problem 7ES

For each positive integer n, let $P\left(n\right)$ be the sentence
In any round-robin tournament involving n teams can be leaked $T_1,\text{}{T}_2,T_3,\mathrm{...},T_n,$ so that $T_i$ beats $T_{i+1}$ for every $i=1,2,\mathrm{...},n.$
a. Write $P\left(2\right).$ Is $P\left(2\right)$ true?
b. Write $P\left(k\right).$
c. Write $P\left(k+1\right).$
d. In a proof by mathematical induction that $P\left(n\right)$ is true for each integer $n\ge 2,$ what must be shown in the inductive step?