Use C$++$ for this. One formula to compute the Euler number e is $1+(1/1!)+(1/2!)+(1/3!)+(1/4!)+(1/5!)...$ where $!$ is the factorial function. Write a program that prompts for the largest denominator n in this series and uses a for loop to sum the series. Finally, display the e approximation:

Enter the maximum denominator for the Euler number approximation series: $20$

The approximation for e is $2\mathrm{.}71828182845905$

n the main$()$ function, use a for loop with an integer index that iterates over $1,2,3,4,...$ A for loop typically assigns an initial value to an integer index, tests whether the index has reached the final value, and modifies the index on the same line. There is no need for nested loops since the value for i$!$ can be calculated from the previously computed value of$($ i$-1)!$ See the provided code for a hint about how to display more than the standard $5$ decimal digits