Given the sequence below, 2. Derive a closed form formula for Mn using any method you like.3. Is the sequence linear, quadratic, cubic, geometric, or something else? Justify your answer.4. Prove that the closed-form formula follows from the recursive definition using MathematicalInduction. Clearly state your inductive hypothesis.

Section 4 [20 pts (5 points each)]: Sequences and Recurrences Let Mn = Mn-1 + 3n -1; M1 = 2. (This is our recursive definition. ) 1. List the first five values in the sequence, M1 to M5 maj = mca) + 3 (1 ) - 1 = 2 m ( 2 ) = M ., 1 + 3 ( 2 ) - 1 = 1+5 = 6 M ( 3 ) = 3 - 1 +9 - 1 = 2+8 = 10 M( ) = 4 - 1 + 12 - 1 = 3 + 11 = 14 mcs ) = . S - 1 + 15 - 1 = 4+14 = 15