Please fill in the missing part of the code where stated #YOUR CODE HERE, code is in python

The secant method is similar to Newton's method, but instead of evaluating f'(x) directly, it uses the approximation xi Xi-1 Implement the secant method by writing code similar to Newton's method, but using this in place of f(x) where it appears in Newton's method def secant(f, a, b, tol-1e-10): Solve f(x) using the secant method" history[] x1ast, 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) [e] history.append ((x, fx)) if np.abs (fx)