For this same function f$,$ show that the running time of the algorithm

on an input of size n is also $($f$($n$)).($This shows an asymptotically

tight bound of $($f$($n$))$ on the running time.