Please do not repeat previous wrong answers

X Newton's Method 3 solutions submitted (max: 10) | View my solutions Problem Summary Implement Newton's method as a function: function [p, n] = myNewton (f, fprime, xo, tol We seek a root of the anonymous function f given an initial guess x0. We input f and its derivative fprime. We will stop iterating once successive iterates are within tol of each other and will return the final iterate as our approximation p. Also output the number of iterations n it took to reach p. As a class convention, we say that the initial guess counts as 1 iteration. So, in a sense, n= 2 would mean we took one step of Newton's method. Function C Reset MATLAB Documentation 1 function [p, n] = myNewton(f, fprime, x0, 2 %input f, anonymous function for root 3 %input fprime, anonlymous function, th 4 %input xo, an initial guess 5 %input tol, a tolerance (method will 6 %output p, a root f(p) = 0 7 %output n, the number of iterations to 8 9 00 Code to call your function C Reset 1 %As a test, the root of f(x) = x+2^x 1 2% define f, fprime, an initial guess 3% send these into the function and ste 4% the method will converge in 6 iterat 5 format long % to display more digits 6 7 Best Solution My Solutions Test Results Solution 5: 0 of 8 tests passed Submitted about 1 hour ago ID 58024454 Size: 65 1 function [P,n] = myNewton(f,fprime, xe,tol) 2. Xinput f. anonymous function for root finding problem 3 Xinput fprime, anonlynous function, the derivative of t 4 Xinput xo, an initial guess 5 Xinput tol, a tolerance (method will stop when successive iterates are within tol of each other) 6 Xoutput P, a root f(p) - O 7 Koutput o, the number of iterations to reach p 8 -2; 9 xoldexe; 10 New-xold-f(xola)/fPrime (xold) 11 while(abs(-xold)>tol) 12 nent1; 13 xoldex New; 14 New-xold-f(xoldy/fPrime (x01d); 15 end 16 pwxNew 17 end 10 Solution 1: 0 of 8 tests passed Submitted on 18 Feb 2021 at 14:11 | ID: 57778744 | Size: 47 1 function [P,n] myfiewton(f,fprime, xe,tol) 2