Factorials. The following set of problems relates to computing factorials. If you did not...

Factorials. The following set of problems relates to computing factorials. If you did not cover the section on recursion, read the material on pages 200–201 for the definition of a factorial and then review the nonrecursive function for computing the factorial.

A convenient approximation for computing the factorial n! for large values of n is given by the Stirling formula

where e is the base for natural logarithms, or approximately 2.718282. Write an integer function for computing this approximation to a factorial. Assume that the corresponding prototype is

int n_fact(int n);