asap

2c) Write Matlab programs for the two methods (Bisection method and New- ton method) based on the modl program given below. For Newton's meth- ods, lise the initial gae880 = 1. Print out the approxination given after each iteration and the total number of iterations required by each method Note that for these methods, we will assume we have satisfied the given accu- racy requirement if two successive iterates agree to the given error tolerance % Bisection % a = left end point of interval containing the root % b- right end point of interval containing the root % to1x-error tolerance in x % tolf error tolerance in the function value % N- the current iteration number % Nmax naximum number of iterations % fcn.n i8 the name of the file containing the function format long a-1; b-4 N-1: Nmax50 tolx = .001; tolf 0.000001 fa feval'cn', a); fb feval'cn, b) m-(a+b)/2; fm= feval(fcn , m); uhile (abs(b-a) tolx) & (abs (fn) > tolf) & (N