$3.(10$ pts$.)$ Find an exact closed$-$form formula for M$($n$),$ the worst$-$case number of multiplications performed by the following function on input n$,$ when n is a power of $5$: int p$3($unsigned n$)$ if $($n$1)$ return $1*23$; return p$3($n$/5)$ p$3($n$/5)*45$;$(10$ pts$.)$ Find an exact closed$-$form formula for $M(n),$ the worst$-$case number of ${?}^{**\text{'}}$ s performed by the following algorithm on input $n$ :

int p$1($int $n)$

$\{$

if $(n==0)$

return $1*2*3$;

int ans $=1$;

for $($int i$=0$; i