Write a MATLAB program not using built-in functions that finds the root of the polynomial f(x) = x³+2x²+10x-20 in the interval [1,2] by the following methods.

a) Bisection b) Regula Falsi c) Modified Regula Falsi, d) Newton e) Secant.

Use a nested formula for the polynomial evaluation, double precision, and an error tolerance for the root of 1/2x10^-14.

Report the number of steps to reach the error tolerance for each method.

For the Newton and Secant methods make a Table showing the root approximations for each step until convergence. Try a few starting points. How sensitive is the number of iterations to the choice of starting point(s).