Write a Haskell program for the following:

The bisection method is a neat way to find (approximate) roots to continuous functions - it has advantages to Newton's method because it only requires the function to be continu- ous instead of differentiable. Fix e to be a really small number (sometimes called machine epsilon) by making it a constant e :: Double e = exp(-150) We will regard any z with x| Double)-> (Double, Double) ->Maybe Double which given a function f and a pair of initial values (a,b), returns, when f(a) and f(6) are of opposite sign or one is effectively zero, the value (up to e!) of a zero crossing for the function f. The bisection method is a neat way to find (approximate) roots to continuous functions - it has advantages to Newton's method because it only requires the function to be continu- ous instead of differentiable. Fix e to be a really small number (sometimes called machine epsilon) by making it a constant e :: Double e = exp(-150) We will regard any z with x| Double)-> (Double, Double) ->Maybe Double which given a function f and a pair of initial values (a,b), returns, when f(a) and f(6) are of opposite sign or one is effectively zero, the value (up to e!) of a zero crossing for the function f