Question $3.$ Exercise $2\mathrm{.}12$ from DPV$.$ Give an exact answer $($in addition to your $$ bound$)$ for

extra credit.

$2\mathrm{.}12.$ How many lines, as a function of $n($in $(*)$ form$),$ does the following program print? Write a

recurrence and solve it$.$ You may assume $n$ is a power of $2.$

function f$($n$)$

if n $>1$:

print$\_$line$(\text{'}\text{'}$still going'$\text{'})$

f$($n$/2)$

f$($n$/2)$