Prove the statement is true using mathematical induction: 2n-1 ≤ n!, where n is an integer greater than or equal to 1.

A) Assume true for k, then prove for k+1
B) Base case: n = 1
C) Use strong induction
D) n! ≤ 2n for all n