Write a recursive function that implements the bisection method to find the root of a given function f(x). The function header for the bisection method should be similar to the one in the first problem, using the same inputs as a minimum and producing the same outputs. You may find it necessary to use some extra variable or variables as input arguments. Run this code on the function:

?

with the initial bounds xL = -1; xR = 9. For this problem submit the equivalent files as outlined: a function file, script file, and output file. Your output must also meet the same requirements: the value of the root, function value at the root, and number of iterations performed.

f(x) = (? -7