Given T(n)=2T(n/2)+nlog2nT(n) = 2T(n/2) + n \log_2 nT(n)=2T(n/2)+nlog2n, what is the complexity by the Master Theorem?
Θ(nlog2n)\Theta(n \log^2 n)Θ(nlog2n)
Θ(nlogn)\Theta(n \log n)Θ(nlogn)
Θ(n2)\Theta(n^2)Θ(n2)
Θ(n2logn)\Theta(n^2 \log n)Θ(n2logn)