Proof WritingMediumInduction ShareInduction · Medium problemTo prove n!≥2n−1n! \ge 2^{n-1}n!≥2n−1 for all n≥1n \ge 1n≥1, the inductive step assumes k!≥2k−1k! \ge 2^{k-1}k!≥2k−1. Which statement must it prove?A(k+1)!≥2k+1(k + 1)! \ge 2^{k+1}(k+1)!≥2k+1B(k+1)!≥2k(k + 1)! \ge 2^k(k+1)!≥2kCk!+1≥2kk! + 1 \ge 2^kk!+1≥2kD(k+1)!≥2k−1(k + 1)! \ge 2^{k-1}(k+1)!≥2k−1Check Show answer Walk through it step by step Practice more like this Review this concept