Prove the best asymptotic upper bound you can on the worst case runing time of the following recurrence:

T(n) = T(n / 4 ) + (n²) + (n log n) + (n)