The solution of recurrence relation T(n) = 2T(√n) + log(n) is

1. A.

   O(log(n) log(log(n)))

2. B.

   O(log(n) log(n))

3. C.

   O(n log(n))

4. D.

   O(log(n))

Attempted by 25 students.