Use the principle of mathematical induction to show that P(n) is true for n = b, b + 1, b + 2, . . . , where b is an integer, if P(b) is true and the conditional statement P(k) → P(k + 1) is true for all integers k with k ≥ b.