P(n) says that a postage of 5n cents can be formed using just 10-cent and 15-cent stamps. We prove that P(n) is true for n>2, i.e., any amount of 10-cents or more postage that is a multiple of 5 can be made using only 10 cent or 15 cent stamps. (a) Prove P(n) for all n > 2 by regular induction below. [2 Pts] Prove P (2), to complete the basic step. [6 Pts] Prove that p(k) p (k+1) for all k > 2. i. ii. (b) Now, prove P(n) for all n > 2 by strong induction. i. ii. [3 Pts] Prove the basic step. How many base cases do you have? [5 Pts] Now, prove the inductive step.