Steffensen's method is another way to find the numerical solution to a nonlinear equation $($root finding$).$ It is similar to the Newton$-$Raphson method, but it does not require the derivative of the function. The solution starts by choosing a point, $x_i,$ near the solution, as the first estimate of the solution. The next estimate, $x_{i+1}$ is calculated by:

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

Write a MATLAB user$-$defined function that uses Steffensen's method $($start by modifying the Newton$-$Raphson code we wrote in class$).$ The input arguments should be

the function and the initial guess and the output argument should be the solution. The iterations should stop when the relative error is less than ${10}^{-6}.$ The number of iterations should be limited to $100($to avoid an infinite loop$).$ If a solution is not obtained in $100$ iterations, the program should stop and display an error message. Test the function by using it to solve the solution to $x=2e^{-x}.$ You should check the answer either using the function or by using MATLAB's built$-$in function fzero.