Find an expression $($as a summation$)$ for f$($n$),$ the number of times

is performed when the algorithm is executed. Show your intermediate steps