I know the answer is (nlglgn) but I want to know how to get to that asnwer, using substitution or recursion tree, since master theorem will not work here.

Give asymptotic upper and lower bounds for TOn) in each of the following recurrences. Assume that T(n) is constant for sufficiently small n. Make your bounds as tight as possible, and justify your answers