Given T(n)=4T(n/2)+n2lognT(n) = 4T(n/2) + n^2 \log nT(n)=4T(n/2)+n2logn, what is the asymptotic complexity of T(n)T(n)T(n)?
O(n2logn)O(n^2 \log n)O(n2logn)
O(n2)O(n^2)O(n2)
O(n3)O(n^3)O(n3)
O(n2log2n)O(n^2 \log^2 n)O(n2log2n)