Prove the following statement by mathematical induction.

For every integern?0, 2ⁿn+ 2)!.

(b) Show that for each integer k 2 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 2 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