function [R] = myNewton1(f, x0, tol)

which takes as inputf: a function handle x0: the initial guess of the root tol: a tolerance above which the algorithm will keep iterating. Tips: The code should calculate the value of the derivative of the function numerically. You may use your myPartialDeriv or implement a finite difference approximation. Be sure to include an iteration counter which will stop the while-loop if the number of iterations get greater than 100. It is not necessary to print out a convergence table within the while loop. (I.e., there should be no fprintf statements in your code)

Test Case: >> format longg

>> f = @(x) 2*(1-cos(x))+4*(1-sqrt(1-(0.5*sin(x)).^2)) - 1.2;

>> [root] = myNewton1(f, 1, 1e-8)

root = 0.958192178746275