One method of finding roots of an equation on a computer is the false position method. The idea is that for a function f(x), you find two values, f(x1) and f(x2) such that f(x1)* f(x2) is less than zero (think about what that means). We would then approximate a line between the points (x1 , f(x1)) and (x2, f(x2)), and then calculate where that line crosses the x axis at x3. We then look at f(x3) and determine if the root is between x1 and x3 or x2 and x3, and repeat the process. The algorithm finds x1 and x2 through trial and error or a coarse search. You are allowed to put in guesses for x1 and x2, but you are not allowed to call any other MATLAB commands to generate these guesses. Your assignment is to do the following:

1. Create a flow chart, pseudo code, or other outline of the algorithm you need to implement. This will need to be turned in with your MATLAB code.

2.Create a MATLAB script that implements this algorithm. You are not allowed to use any MATLAB functions that implement this algorithm. The mathematical function that you intend to find the roots of should be assumed to be in a function of the form function y = mathroots(x) So, for example, if you wish to find the roots of a simple quadratic equation, you would create the function function y = mathroots(x) y = 3*x^2 + 2 * x + 1; and store it in the file mathroots.m.

3. Test your script with one or two functions, and include the results of those tests in your code as comments