$***$MATLAB$***($please provide screen shots of codes$)$ Write a user$-$defined function with function call $[r,k]=$ root$\_$finder $(f,x,$kmax,tol$)$ where $f$ is an anonymous function, $x$ is a

specified value, kmax is the maximum number of iterations, and tol is a specified tolerance. The function sets $x_1=x_0,$ calculates

$|f(x_1)|,$ and if it is less than the tolerance, then $x_1$ approximates the root $r.$ If not, it will increment $x_1$ by $0\mathrm{.}01$ to obtain $x_2,$ repeat the

procedure, and so on$.$ The process terminates as soon as $|f(x_k)|$ tol for some $k.$ The outputs of the function are the approximate

root and the number of iterations it took to find it$.$ Execute the function for $f(x)=x^2-3\mathrm{.}3x+2\mathrm{.}1,x_0=0\mathrm{.}5,$kmax$=50$ tol $={10}^{-2}.$