please use python code to solve

Develop a Newton-Raphson code to compute the solution of the following nonlinear system of equations. You can start with 1=1.5 and 2=2.5. x12+x1x2=10x2+3x1x22=57 a. Is there any difference in the solution using numerical or analytical Jacobians? b. Plot the rate of convergence of the method. Is it quadratically convergent? c. Use the Python clock function (time()) to time all roots calculations from the analytical and numerical Jacobians. What do you observe? Which method is the fastest? Why? Based on the codes created for Lab 3, use the Newton-Raphson method and the built in function (roots) to determine the roots of f(x)=x516.05x4+88.75x3192.0375x2+116.35x31.6875 a. Plot the function using an interval of your own judgment b. Use the My_Newton-Raphshon method that you coded with initial guess of x0=0.5825 and meeting a specification of a0.01%. c. Use the Numpy built-in Newton-Raphson and Secant functions to check on the solutions. d. Use the NumPy polynomial built-in functions to compute all the roots of the equations e. Use Python clock function (time()) to time all roots calculations from (a), (b) and (c) above. What do you observe? Which method is the fastest? Why? f. Analyze why (b) and (c) found the roots as they did. A graph may help