Show that for each integer k 0, if P(k) is true, then P(k + 1) is true. (For each answer, enter a mathematical expression.) (i) Let k be any integer with k 0, and suppose that P(k) is true. In other words, suppose that . [This is P(k), the inductive hypothesis.] (ii) We must show that P(k + 1) is true. P(k + 1) is the inequality . (iii) Information about P(k + 1) can be deduced from the following steps. Identify the reason for each step. 2k