A recurrence $T(n) = 3T(n/4) + n\log_2 n$ arises from a divide-and-conquer algorithm. Using the Master Theorem with $a = 3, b = 4, f(n) = n\log_2 n$, note that $n^{\log_4 3} \approx n^{0.792}$. What is $\Theta(T(n))$?