Write a Python program to implement the regula falsi method. The definition statement of your program should be:
def regfalsi(f, a, b, tol)
where f is an externally defined function, a and b are the endpoints of the interval which contains the root, and tol is the bound on the absolute error.
Your output statement should be: "The approximate solution from regula falsi is XXXXXX, which was found in YYYYYY iterations." where you will have numbers in place of XXXXXX and YYYYYY. You should copy your bisection code and make a few modifications for regula falsi. Again, test your program on the function in #2. Print out your iterations and compare with your answers from #2.