The below formula is presenting a convenient approximation for computing the factorial n! for large values of n like below equation. n! = squareroot 2 Pi n (n/e)^2 where e, the base for natural logarithms, is 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); The below formula is presenting a convenient approximation for computing the factorial n! for large values of n like below equation. n! = squareroot 2 Pi n (n/e)^2 where e, the base for natural logarithms, is 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)