In the recurrence T(n)=2T(n/2)+nT(n) = 2T(n/2) + nT(n)=2T(n/2)+n, what is the complexity according to the Master Theorem?
O(n)O(n)O(n)
O(nlogn)O(n \\log n)O(nlogn)
O(n2)O(n^2)O(n2)
O(logn)O(\\log n)O(logn)