Which of the following are steps for a proof by mathematical induction that p(n) is true for all positive integers n?
1) Base case: Show that p(1) is true.
2) Inductive step: Assume that p(k) is true for some positive integer k.
3) Inductive hypothesis: Show that p(K⁺1) is true based on the assumption in the previous step.
4) Conclusion: Conclude that p(n) is true for all positive integers n based on the base case and the inductive step.