MATLAB problem. Please copy or attach the code.

The bisection method in mathematics is a root-finding method that repeatedly bisects an interval and then selects a subinterval in which a root must lie for further processing. It is also one of the most fundamental numerical methods. The basic algorithm of a bisection method is: Determine the initial interval where the root lies Find the mid-point of the interval Evaluate if the root should lies in the left subinterval or right subinterval The subinterval that the roots should be in becomes the interval for the next iteration Repeat Steps 1) through 4), until the size of the interval is small enough (usually it will be compared to a preset tolerance) Write a MATLAB program that uses the bisection method to find the roots of this function: f(x) = x^2 + 2.5x - 59 Initial evaluation of the function indicates that there are two real roots, located in the range (-10, 0) and (0,10), respectively. (See plot to the right rightarrow) Specifications: You cannot solve the quadratic equation analytically. You may hardcode the intervals. The tolerance is set to be le-6. The numerical root is the midpoint when the interval is narrower than the tolerance. Output the result with 4 decimal places. Name your script "Bisection.Lastname.m