What is the asymptotic complexity of T(n)=2T(n/2)+O(nlogn)T(n) = 2T(n/2) + O(n \log n)T(n)=2T(n/2)+O(nlogn) using the Master Theorem?
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(logn)O(\log n)O(logn)