in a proof by mathematical induction that p(n) holds for every integer n > 2, what must be shown in the inductive step? a. we need to show that if k is any integer with k >2 and if p(k) is true, then p(k 1) is also true. b. we need to show that if k is any integer with k >2 and if p(k) is true, then p(k 1) 15 false. c. we need to show that if k is any integer with k > 2 and if p(k) is false, then p(k 1) is true. d. we need to show that if k is any integer with k > 2 and if p(k) is false, then p(k 1) 15 also false.
