use python 3 please

Recall (from Calculus I) Newton's method for approximating a zero of 'nice' function. Suppose that f(t) is differentiable on R and I, is an initial guess for a zero of f. Geomet- rically, the idea behind Newton's method is to use a linear approximation of f at the point (to: f(x0)) and find the zero of that linear approximation. This gives a new approximation I for a zero of f. . TO 31 (co, f(x)) 1 Under suitable conditions, I will usually be a better approximation than to, and this process can be repeated until an approximation of desired accuracy is achieved (or until it becomes obvious that the produced sequence is diverging). Working out the resulting formulas gives a sequence of successive approximations determined by In+1 = In Clearly, this is invalid if f'(In) = 0, and on a computer we actually need to be concerned with f'(In) being too close to zero. (1) (10 points) Write a function Newton (Function, Derivative, xo, epsilon), which implements Newton's method. The parameters to this function are as follows: Function: The name of a Python function which takes a single floating point number x and returns f(c), for some function f to be determined later. Derivative : As above, except this function evaluates and returns the derivative f'(x) of the same function. tion. above, ex redan evaluates x : An initial point for Newton's method. epsilon: A tolerance; the function should return the first number In in the sequence for which \f(In)