I need the Matlab solution

One method for finding the approximate roots) of an equation f(ex)-0 is the ton-Raphson method. This method requires the user to make an initial guess of the root of the equation, and then apply a recursive formula to converge toward the actual root. This requires iterations, and the more iterations conducted, the more accurate the approximation will be (beware that convergence is not guaranteed). The formula for the Newton-Raphson method is given as New initiali 'k+1 =-4 )ula fortheNe will and temero Xp+1-Xp--en , k = 1, 2, 3, where One method for finding the approximate roots) of an equation f(ex)-0 is the ton-Raphson method. This method requires the user to make an initial guess of the root of the equation, and then apply a recursive formula to converge toward the actual root. This requires iterations, and the more iterations conducted, the more accurate the approximation will be (beware that convergence is not guaranteed). The formula for the Newton-Raphson method is given as New initiali 'k+1 =-4 )ula fortheNe will and temero Xp+1-Xp--en , k = 1, 2, 3, where