Inductive step I am getting wrong, second box

(1 point) Use the theorem that (m) = (m) + (m, !) for all m > > 0, and the principle of mathematical induction to prove the formula (") + (1) + (23) +...+ (")=2" for all non-negative integers n. NOTE: Input your answers, when appropriate, in the following manner: i.e. () is equivalent to entering C(n, k) into the answer box. Proof: Base Case: (n = 0) (n) = Thus the base case holds for n = 0. Inductive Hypothesis: Suppose the formula is true for n = k 2 0 ; that is (b ) + ( * ) + (2 ) + ... + ( * ) = 2 AK Inductive Step: We shall verify the formula for n = K+1 that is (k+1 ) + (k+1 ) + ( k+1 ) +... + C(K+1, K+1) = 24(K+1)