Using the Master Theorem, determine which of the following recursion relations describe functions whose growth rate is O(n log n). In all cases, you may assume that T(1) = 1.

T(n)=5 T(n / 2)+n^{3} T(n)=5 T(n / 5)+n T(n)=4 T(n / 2)+n \log n T(n)=T(n / 4)+n \log n T(n)=T(n / 4)+n \log n