$[4$ marks$]$ Describe a recursive method for solving $ln(n!).$ Note, your algorithm $f$ act$\_$ln$(n)$

should call fact$\_$ln $(n-1).($assume $ln$ is a built in math function$).$ Count the assignments

$($including returns$)$ and comparisons in order to derive a recurrence equation for the worst$-$

case runtime of your algorithm.