Please help complete this code in Python using Newton's Method with a line search for rootfinding.

Newton with a line search Newton's method is often paired with a line search which finds the smallest non-negative integer k such that wwhor Xn+1 = Xn-Pf(x)/f' (x). Implement this algorithm def newtonls(f, a, b, tol-1e-10): ""Newton 's method with a line search""" x=(a + b) / 2 history = [] for i in range (100): fx, dfx = f(x) history.append((x, if numpy . abs (fx) fx)) tol: break # YOUR CODE HERE raise NotImplementedError() return numpy.array(history) Newton with a line search Newton's method is often paired with a line search which finds the smallest non-negative integer k such that wwhor Xn+1 = Xn-Pf(x)/f' (x). Implement this algorithm def newtonls(f, a, b, tol-1e-10): ""Newton 's method with a line search""" x=(a + b) / 2 history = [] for i in range (100): fx, dfx = f(x) history.append((x, if numpy . abs (fx) fx)) tol: break # YOUR CODE HERE raise NotImplementedError() return numpy.array(history)