Computer Science - Discrete Structures Multiple Choice

Select the mathematical expression that is equivalent to the sum ??--2jMJ-2n-4jj+7 n-5 i+7 n+3 O Let S(n) be a statement parameterized by a positive integer n. Consider a proof that uses strong induction to prove that for all n24, S(n) is true. The base case proves that S(4), S(5), S(6), S(7), and S(8) are all true. Select the correct expressions to complete the statement of what is assumed and proven in the inductive step Suppose that for k2(A?), S(j) is true for every j in the range 4 through k. Then we will show that (B?) is true