Consider the following classical recursive algorithm for computing the factorial n$!$ of a non$-$negative integer n: F$\text{'}(\%.$$$+\text{'}*($n$)$: if n $=0$ return $1$ else return n $$ F$\text{'}(\%.$$$+\text{'}*($n $\text{'}1)($a$)$ How many multiplications does this algorithm perform?

Unknown. $01-$recursion $($p$.37).$ Kindle Edition.