7. The first n positive odd integers are 1, 3, 5, 7, 9,..., 2n-1. Follow the steps to prove by mathematical induction that the sum of the first n odd integers is equal to n2 a. State the proposition P(n). b. Show that P(n) is true in the base case when n 1 (i.e, show P(1) is true). c. State the inductive hypothesis, i.e. what you're assuming in the inductive step. d. State what you are going to prove in the inductive step e. Complete the inductive step, identifying where you use the inductive hypothesis