1.100 pts) Write a program that implements the following functions iteratively (no recursion):
- double factorial(int n)
- double exponent(double x, int n)
The functions implemented should follow the guidelines below:
- factorial: Computes n! = n * (n-1) * ... * 1
- exponent: Computes the sum of the first n terms of e using the following approximation:
- f(x,n) = e^x / (2^n * n!)
You can use the pow() and factorial() functions in your exponent function.
In the main function, use argc and argv to read the values of n and x from the user. Compute and print the approximation of e for all values up to n using the exponent function. Print the results as a table, as shown below. Also, print the exact value of e using the math library function exp().
When you increase the value of n, your result should get closer to the result of exp().
Name your program assign3.c.
Sample execution of the program is given below. The first parameter is n and the second parameter is x. You need to use the atoi() and atof() functions in stdlib.h to convert strings to integers and doubles, respectively.
fox01> assign3 10 2.2
i Approximation
0 1.0000000000
1 3.2000000000
2 5.6200000000
3 7.3946666667
4 8.3707333333
5 8.8002026667
6 8.9576747556
7 9.0071659835
8 9.0207760712
9 9.0241029815
10 9.0248349018
Exact Value: 9.0250134994
