Solve the following recurrence (a solution will have no remaining sums or recursive definitions and will be somewhat simplified-minimize the number of terms within reason). You will have to find a pattern in the "layer costs". Be sure to look at Appendix A: 3. T(n)T(n-1) +n2-(n-1)2 7(2) = 1