Below is Part B

C. Exercise: Bisection root finding method. Use the bisection root finding method to find the first three roots from Exercise B Guidelines Start with the project BisectionRootFinding (in file BisectionRootFinding.zip) Complete the following functions * e double findRoot (double lower, double upper, double *root) double func (double x) The findRoot function must implement the bisection root finding method. Use the symbolic constant EPSILON (set to le-10) in developing the findRoot function. Consult the notes, in particular the bisection root finding algorithm. Take the time to design the functions first before coding, that is, ensure you understand the logic of each function. The function func shall return the value for f/(x) for the given x according to Equation 2 (you have already created this function in Part B) Run the program to find the first three roots. Compare with the results from Part B * Show the TA your running program and the modifications to the code to get your marks. C. Exercise: Bisection root finding method. Use the bisection root finding method to find the first three roots from Exercise B Guidelines Start with the project BisectionRootFinding (in file BisectionRootFinding.zip) Complete the following functions * e double findRoot (double lower, double upper, double *root) double func (double x) The findRoot function must implement the bisection root finding method. Use the symbolic constant EPSILON (set to le-10) in developing the findRoot function. Consult the notes, in particular the bisection root finding algorithm. Take the time to design the functions first before coding, that is, ensure you understand the logic of each function. The function func shall return the value for f/(x) for the given x according to Equation 2 (you have already created this function in Part B) Run the program to find the first three roots. Compare with the results from Part B * Show the TA your running program and the modifications to the code to get your marks