Please help with completing this code in Python using the Secant method for rootfinding.

Secant method The secant method is similar to Newton's method, but instead of evaluating f'(x) directly, it uses the approximation i-Xi- def secant(f, a, b, tol-1e-10): "Solve f(x) using the secant method" history = [] xlast, flast = b, f(b)[0] # We'LL use x-b as our Last evaluation to initialize x=(a + b) / 2 for i in range(100): # And start with the midpoint as the current guess fx = f(x)[0] history.append((x, if numpy.abs(fx) fx)) tol: break # YOUR CODE HERE #raise NotImplementedError() return numpy.array(history)