Implement the Bisection Method for solving equations. Use the following function:
double root(double (*pf)(double x), double a, double b, int n)
Here, pf points to a function f that defines the equation f (x) = 0 that is to be solved, a and b bracket the unknown root x (i.e., a £ x £ b), and n is the number of iterations to use. For example, if f (x) = x 2 - 2, then root(f,1,2,100) would return 1.414213562373095 ( = Ö2), thereby solving the equation x 2 = 2. The Bisection Method works by repeatedly bisecting the interval and replacing it with the half that contains the root. It checks the sign of the product f(a) f(b) to determine whether the root is in the interval [a, b].