A problem with factorials is that they rapidly become very large. Sometimes we don’t need...

A problem with factorials is that they rapidly become very large. Sometimes we don’t need the factorial itself; we just need the logarithm of the factorial. In that case, rather than computing the factorial and then taking the logarithm, it’s better to take the logarithm of each component and then add the components instead of multiplying them. Modify the Factorial program in Figure so that it returns the natural logarithm of the factorial of the user-entered number.

Figure Use of recursion to calculate the factorial of an integer