Write a program which finds an approximate solution to an equation f(x)= 0 for some function f. use the bisection method. to solve the problem using this method first find two values of x, a, and b, such that when evaluated in the function f(x) they give opposites signs for the y value. if f(x) is continuous between these two values then we know that there is at least one x which evaluates to a 0 y value, which is between these two values a and b. treat the positive value as an upper bound and the negative value as a lover bound . divide the space between a and b in half and evaluate the function at that new point. if the value is positive that it replaces the existing upper-bound and if it is negative it replaces the existing lower-bound. continue dividing the space between the upper-bound and lower-bound in half and evaluating this new value and generating new upper and lower bounds the case may be. continue the evaluation process until the x value that you plugging in to the function evaluates to a y value that is zero plus of minus .1