In probability calculations, we frequently need to compute the value of the factorial of s...

In probability calculations, we frequently need to compute the value of the factorial of some number 

n

n

n!

When n is a very large number, this is a time-consuming calculation. Fortunately, there is a handy formula, called Stirling’s Formula, which gives a very good approximation of n! whenever n is large. Stirling’s formula says:

The symbol π is the ratio of a circle’s perimeter to its diameter, and the symbol E is the base of natural logarithms. The actual value of n! is always slightly smaller than the value given by this formula. For this exercise, write a Java code fragment that implements Stirling’s formula.