/sci/ - Science & Math

I figured this might be more appropriate for /sci/ than /g/.

How do you solve a recurrence if you aren't given a base case? I'm trying to get my CS homework done but I have no idea how you're supposed to solve it without any kind of base case(s).

The instructions are "Solve the following recurrences, but without computing multiplicative constants (Ci). Thus, in this exercise the base cases are not needed"
One of the problems is T(n) = 4T(n-1) - 5T(n-2) + 2T(n-3) + n - 3 + (5n^2)*2^n
And that's all the information I am given. I've looked through the chapter and every example they give a base case.