Please use C.

Thank you!

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 below guidelines factorial: Computes n! = nx(n - 1) x ... x 1 exponent: Computes the sum of first n terms of e^x using the following approximation. f(x, n) = e^x = sigma^n_i=0 x^i/i! = x^0/0! + x^1/1! + x^2/2! + ... + x^n! You can use pow() and factorial() functions in your exponent function. in main() use argc and argv read the value of n and x from the user and compute and print the approximation of e^x for all values up to n using the function exponent. Print the results as a table as shown below. Also, print the exact value of e^x using the math library function exp(). When you increase the value of i your result should get closer to the result of exp. fox01> assign3 10 2.2 0000000000 2000000000 6200000000 3946666667 3707333333 8002026667 9576747556 0071659835 0207760712 0241029815 9.0248349018 Exact Value = 9.0250134994