(a) Explain why computing the factorial of n by multiplying

(a) Explain why computing the factorial of n by multiplying all values from 1 to n together is an exponential time algorithm.
(b) Explain why computing an approximation to the factorial of n by making use of Stirling’s formula (see Section 2.2) is a polynomial time algorithm.




2965