the tangent line to the function curve at $x_i.$ Thus, the Newton$-$Raphson formula for the next estimate of the root is given by the root of the tangent line:

Y

$x_{i+1}=x_i-\frac{f(x_i)}{f^{\text{'}}(x_i)}$

This iteration process repeats until the root is found to within a given tolerance. The iteration is not guaranteed to converge so there needs to be a maximum iteration that occurs.

Write a function NewtonRaphson that implements the Newton$-$Raphson method. Your function should accept the following inputs:

func $=$a handle to a MATLAB function of $f(x)$

func$\_d=$a handle to a MATLAB function of $f^{\text{'}}(x)$

$x0=$ initial guess for the root

Your function should return the following output:

$x=$ computed root estimate

Your solution should do the following:

Implement the Newton Raphson method to find a root of $f(x)=0$ and print the iteration history. Do not use the MATLAB solver functions like fzero, solve. roots, etc.

Terminate the search when the relative error tolerance is reached or when the iteration limit is reached $($whichever occurs first$).$