Given the algorithm:

C$($n$)$

$\{$if n$>=1$

st$1$;

return $2*$C$($n$-1)$;

else return d;$\}$

The recurrence representing its running time function, for n$>=1,$ is