2. Finding Roots by the Newton-Raphson method ORIGIN 1 This code should output - the iteration number, -the guess for the root at that iteration, - the iterative convergence at every iteration - and the residual at every iteration - Set the stopping criteria to when both the residual and iterative convergence are less than 10A-5, i.e IGinitial guess Cd0.125 Vn- 20 15 : 10 g.Cd 126252455-743-tanh 1.22625 39.24-tanh 4 2.452578.48-Xtanh4 gsg) -sg() -> dx 78.48-x 2 1.22625 while E. 10-5 v, . 210-5 ^ 1 100 i+1 converges i+1 residual Newton augment(it.x.E8) Test-Newton(%) 7.985 35.474 22.464 0.299 1 15 10 16.131 0.619 2.041 0.02 2-1.131 l est=14 -3.79 5-3.771 6 -3.771 8.906 x 10 7-3.771 1.76710-y 1.77610- 1.326 10 2.631 x 10 14 root fg(x),x)5.604 2. Finding Roots by the Newton-Raphson method ORIGIN 1 This code should output - the iteration number, -the guess for the root at that iteration, - the iterative convergence at every iteration - and the residual at every iteration - Set the stopping criteria to when both the residual and iterative convergence are less than 10A-5, i.e IGinitial guess Cd0.125 Vn- 20 15 : 10 g.Cd 126252455-743-tanh 1.22625 39.24-tanh 4 2.452578.48-Xtanh4 gsg) -sg() -> dx 78.48-x 2 1.22625 while E. 10-5 v, . 210-5 ^ 1 100 i+1 converges i+1 residual Newton augment(it.x.E8) Test-Newton(%) 7.985 35.474 22.464 0.299 1 15 10 16.131 0.619 2.041 0.02 2-1.131 l est=14 -3.79 5-3.771 6 -3.771 8.906 x 10 7-3.771 1.76710-y 1.77610- 1.326 10 2.631 x 10 14 root fg(x),x)5.604