Function roots = BiSectionSearch (xStart, xStop, xStep, xOverlap, Function) % Function that uses bisection to search for the roots of f(x) % Inputs: xStart and xStep - the end points of the search. % x Step - the size of interval used in search. % x Overlap - the overlap between intervals. % Function - the function to be searched. % Outputs: roots - array of roots found in the search. 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. 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