using Matlab:

1. Bracketing Method (BiSection): (10 points) In this part of the project we will be using the bisection algorithm, to search for the solution to a highly nonlinear function. This will involve a rewrite of the BiSection function a) Rewrite the function BiSection to be BiSectionSearch. The function will use the bisection algorithm to search for a set of roots. It should do this systematically by applying the BiSection algorithm to a set of overlapping intervals that work through the region of the roots. The function call should be as shown below. function rootsBiSectionSearch( xStart, xStop, xStep, xOverlap, Function ) % Function that uses bisection to search for the roots of f(x) % Inputs: xstart and XStop- the end points of the search. xStep - the size of interval used in search. xOverlap the overlap between intervals. Function- the function to be searched. % Outputs: roots - array of roots found in the search. As an example of how the intervals should be set up this is how I started the first interval. x0 = xStart; x1x0 xStepi The next interval would be x0 = x1-xOverlap; x1 = x0 + xstep