单选题：To solve a problem with input size $$N$$ by divide and conquer,

To solve a problem with input size $$N$$ by divide and conquer, an algorithm divides the problem into 3 subproblems with size $$\sqrt N$$ (assuming it is an integer ) and the time recurrences is

$$T(N) = 3T(\sqrt N)+log(N)$$.

What is the overall time complexity of this algorithm? @[A](3)

A. $$O((\log N)^{\log_2 3})$$
B. $$O((\log N)^{3/2})$$
C. $$O(\log N \log\log N)$$
D. $$O(\sqrt N\log N)$$




A.$$O((\log N)^{\log_2 3})$$
B.$$O((\log N)^{3/2})$$
C.$$O(\log N \log\log N)$$
D.$$O(\sqrt N\log N)$$


答案：A