Choose the true statement.

Any statement that can be proved with ordinary $($or weak$)$ mathematical induction can be proved with strong mathematical induction.

A proof by Strong Induction assumes P$($n$)$ is true for all values of n through k$,$ and then the truth of P$($k$)$ is proved.

Strong Induction Proofs always have more than one base case.

Any induction proof can be written without a base step.