After $k$ steps the argument is $n^{1/a^k}$. Setting this equal to $b$ gives $a^k=\log_b n$, so $k=\log_a\log_b n$. Hence $T(n)=\Theta(\log_a\log_b n)$.
More Asymptotic Analysis and Time/Space Complexity questions
GATE 2019 CS Q47– There are n unsorted arrays: A 1,A 2,,A n. Assume that n is odd. Each of A 1,A 2,,A n…
GATE 2015 CS (CS1) Q60– An algorithm performs ( N)1/2 find operations, N insert operations, ( N)1/2 delete…
GATE 2015 CS (CS1) Q64– Consider the following C function. Which one of the following most closely approximates…
GATE 2017 CS (CS1) Q14– Consider the following functions from positive integers to real numbers: 10, n, n, 2 n,…
GATE 2014 CS (CS1) Q48– A polynomial-time algorithm correctly computing the largest clique of any graph is…
GATE 2014 CS (CS1) Q52– Find the total multiplications in this pseudocode (inclusive loop bounds): D = 2 for i = 1…