Sample question:

Solve the recurrence: T(n) < T(n-2) + n^2

Answer: T(n) = O(n^3).

Because it's < instead of =, your answer is in big O instead of Omega.

Don't be fooled by the fact that it's n-2 instead of n-1.
That does not change the answer asymptotically.