In Calculus you will learn an algorithm called Newtons Method for finding the roots of a equation f(x) = 0. The technique starts from an initial guess x1 and computes a next estimate x2 by: x2 = x1 f(x1) f 0(x1) We then apply the procedure again starting from x2 (in place of x1 in the right-hand-side) and we keep repeating this until successive estimates differ by less than some preset tolerance. Note that each repetition is called an iteration. Write a program called root.c which finds a root of the function f(x) = sin x 2e x in the vicinity of the user provided starting guess x1. Your program must consist of a main program, which opens the output file root.txt for appending (mode = a), reads the initial guess (x1) and desired error tolerance (tol) from the user, calls the function newton, described below, and writes the estimated root (root) and number of iterations(iter) required to the output file. Aside from the main, your program must consist of the following three functions; f which takes an argument x and returns f(x) = sin(x) 2e x , df which takes an argument x and returns f 0 (x) = cos(x) + 2e x newton which takes the initial guess x1 and the desired tolerance tol as arguments and calculates and sets (in main) both the estimated root (root) and the number of iterations (iter) required to find this root within the desired tolerance. Assume that the tolerance in this case refers to an absolute tolerance, i.e. quit when |x2 x1| < tol. Here is a plot of sin x 2e x : 0 1 2 3 4 5 6 2 1.5 1 0.5 0 0.5 1 y = sin(x) 2exp(x) There are roots near 1.0 and 3.0. For marking purposes run your program twice with starting values of 1.0 and 3.0, both times with an error tolerance of 0.0001. Your output should look like: After 3 iterations the estimated root near 1.000000 is: 0.921025