1. (20 points) Consider the following recurrence T(n) = T(n-1) + 4n + 1 Now suppose we think the solution is (a) (6 points) If T(n)-2? + 3n then T(n-1)- (b) (10 points) Using substitution, verify that the solution is correct: (c) (4 points) In simplest form, the asymptotic complexity of T(n) is