In the recurrence T(n)=2T(n/2)+nlognT(n) = 2T(n/2) + n \log nT(n)=2T(n/2)+nlogn, what is the complexity?
O(nlogn)O(n \log n)O(nlogn)
O(nlog2n)O(n \log^2 n)O(nlog2n)
O(n2)O(n^2)O(n2)
O(nlogn2)O(n \log n^2)O(nlogn2)