A recurrence relation is given by T(n)=2T(n)+log2nT(n) = 2T(\sqrt{n}) + \log_2 nT(n)=2T(n)+log2n. What is the asymptotic complexity of T(n)T(n)T(n)?
O(logn)O(\log n)O(logn)
O((logn)2)O((\log n)^2)O((logn)2)
O(n)O(n)O(n)
O(n)O(\sqrt{n})O(n)