Which of these are steps for a proof by mathematical induction that P(n) is true for all positive integers n?
a) Base case: Prove P(1) is true
b) Inductive step: Assume P(k) is true for some arbitrary positive integer k
c) Show that P(k+1) is true whenever P(k) is true
d) Conclusion: P(n) is true for all positive integers n