Consider the below algorithm and n$\text{'}$s that are power of $2$ and $n0.$ To determine the number of times the phrase 'still going' will be printed, which problem should be solved?

ALGORITHM $f(n)$

$ifn>1$ then

print$(stillgoing)$

$f(\frac{n}{2})$

$f(\frac{n}{2})$

$T(0)=0,T(n)=2T(\frac{n}{2})$

$T(1)=0,T(n)=2T(\frac{n}{2})$

$T(0)=0,T(n)=2T(\frac{n}{2})+1$

$T(1)=1,T(n)=2T(\frac{n}{2})+1$