in python:The function $f(x)=27x^4+162x^3-180x^2+62x-7$ has a zero at $x=\frac{1}{3}.$

Perform ten iterations of Newton's method on this function, starting from $p_0=$

$0.$ What is the apparent order of convergence of the sequence of approximations?

What is the multiplicity of the zero at $x=\frac{1}{3}?$ Would the sequence generated

by the bisection method converge faster? Demonstrate numerical performance

of both methods. Note: this problem requires writing codes that implement the

above methods and analyze their numerical performance. Please include your

programs and screenshorts of the output$/$results$.$