I have to solve the following recurrence but I keep getting stuck.
T(n) = 1, n=0
T(n) = T(n-1) + n^2, when n>1
I start by plugging in (n-1) into the function again to get...
T(n)=(T(n-2)+(n-1)^2)+n^2
Which simplifies down to (T(n-2)+2n^2-2n+1.
I then do it again and get this...