Give as tight of an upper bound on T(n) as you can, in big-Oh notation). Justify the upper bound on T(n):

The algorithm takes an instance of size n, works for O(n3) time, makes one recursive call to an instance of size n 20, and after the recursive call completes, it works for O(n) more time before producing a solution.