For each positive integer n, let P(n) be the property 2n < (n + 1)!.a. Write P(2). Is P(2) true?b. Write P(k).c. Write P(k + 1).d. In a proof by mathematical induction that this inequality holds for all integers n ? 2, what must be shown in the inductive step?

9/30/2017 35FE3C8CD36E4EB5A42D8644984077D5.png https://mail.google.com/mail/u/0/#inbox/15ed44902ae5e6e9projector=1 1/1 9/18/2017 AC5E01278F00459BA285120A4E62DF16.png https://mail.google.com/mail/u/0/#inbox/15e9356a6ae7603eprojector=1 1/1