Can you code the Muller's method in java?

Problem 3. (50 points) Write a program for each of the following root-finding methods: (1) Bisection method, (2) Newton's method, (3) Secant method, (4) Mller's method. Use your programs to find approximations to within 10 to all zeros of the following cubic polynomials. Use Ipn Pn-1l as a measure of error in the iteration. Output all of the iterations. What are your conclusions? (a) r)52+2r (b) ()2r2-5 Problem 4. (15 points) (a) For Bisection method in Problem 3(a), use the theorem to find a bound for the number of iterations needed to achieve 10-4 (b) Observe that Equation 3(a) has a root of 0. Find all the roots of 3(a) algebraically. (c) Compute the absolute error and relative error of your Bisection approximations in Problem 3(a)