The recurrence $T(n) = 3T(n/4) + n\log n$ describes a divide-and-conquer algorithm. Using the Master Theorem with $a = 3, b = 4, f(n) = n\log n$, find $\Theta(T(n))$. (Note: $n^{\log_4 3} \approx n^{0.792}$)