solving recurrence T(n) = T(√n) + theta((lg lg n))


The solution given says that let m = lg n. Recurrence becomes S(m) =S(m/2) + theta(lgm). Case 2 of master’s theorem applies. But how come case