Click and drag the statement in the right column and drop them in their corresponding step numbers to prove the statement that ( S2" for all positive integers n and all integers k with 0 sksn Step 1 So, each one of them is no bigger than this sum. Let n be a nonnegative integer, then C(1, n) + C(2, n) + "" + C(n, n) = n^2. Step 2 Let n be a nonnegative integer, then C(n, 1) + C(n 2) + + C(n n) = 2^n. Hence, the sum of all the positive numbers C(n, k), as k runs from 0 to n, is 2An. Step 3 Hence, the sum of all the positive numbers C(n, k), as k runs from 0 to n is nA2. Reset