2. [4 marks] Suppose an algorithm has a worst-case time complexity given by the following recurrence relation : T(n) = T(n-1) + 6n2 + c2 for n > 0, and T(0) = ci, where c and c2 are constants. Solve the recurrence relation T(n), and give its order using Big- Oh notation. You must explain how you solved the recurrence relation. You might find the list of closed forms provided on the OWL website under "Supplementary Examples" useful