Use python to compute the solution

Write a function with signature FindRootSecant $(\backslash ($ f$,$ x $0,$ x $1\backslash ),$ tol$)$ that implements the secant root finding method. You must write the function so that it only evaluates the function it's finding the root of once per loop $($note this is different from the version of the code in the examples repository$).$ It is important to have an efficient root finder as the function we want to root find on is expensive as it involves solving an ODE.

Test your FindRootSecant function on a cubic polynomial to check that it is working