I have done first part and This question has 13 part but I can't see all part, first i have to solve this then i can see next by next.

Use mathematical induction to prove that the statement is true for every positive integer n. n(n + 1)(2n + 31) 1 . 11 + 2 . 12 + 3 . 13 + ... + n(n+ 10) = 6 What is the first step in a mathematical induction proof? O A. Show that Sk + is true. O B. Show that Sx is true. C. Show that S, is true. O D. Show that So is true. Show that 1 . 11 + 2 . 12 + 3 . 13 + ... + n(n + 10) =- _ n(n + 1)(2n +31) 6 for n = 1. Write the statement S,. 1 . 11= (Type your answer in factored form.)