EECE 540 Spring 2019 Project 1: Finding Roots and Computing Functions Due: February 13, 2019 50 points This projectwl involve writing programs that employ iterative methods to solve a non-lincar equation and uses a constructed function to compute the natural log function, instead of the Taylor's Series. The iterative solutions will hinge on the chosen stopping criteria and proper equation set up It is recommended that you write different test programs for each section. If not, the test programs get so large they are hard to read through. And readability is an important part of writing code. Also m files that implement BiSection, Secantlteration and Newtoniteration are available under the Files->SupportCode" link on canvas. These are provided, since the convergence or stopping criterion can be rather problematic. 0. Coding Grading (5) Comments (2) Variable Naming (1) Structure (1) Other (1) I. Iterative Methods (BiSection, Secant and Newton-Raphson): (30) a) Write a function called BiSectionSearch that will use the BiSection function to search for roots of a function. We will want the search to be done systematically, by applying the BiSection function to a set of overlapping intervals that work through a defined region, searching for the roots. A "reasonable" amount of crror checking should be done at the start of all functions. Also, only call BiSection, if the interval (x0, x1) is a bracket of the root (f(x0)*f(xl)