Report 1 1. Introduction The project is to study root finding algorithms. The algorithms are… (You may comment on advantages/disadvantages of each methods.) (1) Bisection Method (2) Newton’s Method...

Write a program for each of the following root-finding methods:(1) Bisection method, (2) Newton’s method, (3) Secant method, (4) Muller’s method.Use your programs to find approximations to within 10^(-4) to all zeros of the following cubic polynomials.Use |P(n+1)-Pn| as a measure of error in the iteration. Save all of the iterations.What are your conclusions?
(a) f(x) = x^3-5x^2 + 2x
(b) f(x) = x^3-2x^2-5


Put your numerical results in either tables or graphs


Report 1 1. Introduction The project is to study root finding algorithms. The algorithms are… (You may comment on advantages/disadvantages of each methods.) (1) Bisection Method (2) Newton’s Method (3) Secant Method (4) Muller’s Method 2. Numerical results and analysis Put your numerical results in either tables or graphs. If possible, combine results for from different algorithms into a table/graph. Comment on which one is “better” for the given examples. 3. Conclusion From the numerical experiments, we found that… Appendix Attached your codes here