I need part(b) solved please and thank you so much.

I already have part(a) solved here:

(a) Use Newton's method to derive, by handwritten calculations, a recursive algorithm to com- pute the r-th root of N > 0, that is, to compute N1/". (b) Use your answer in part (a) to write a MATLAB script that performs 3 Newton iterations to compute 31/3 starting with Xo = 2, that is, the script should compute X1, X2, X3. In your MATLAB script, declare power(3,1/3) as Xtrue, and compute the relative error |23 Wtrue//\truel. (a) het n = who = 2 = 4. -2x - 120 het fln) = now Derwative, fila) = rnr-1 -0. According to Newton's method of root esternality Niti = Ni f(mi) nn.nl ni (rno8-) - (08. - 2; 3; rnir : + [ 14 (7-1) times ] Algorithm is neculten Make an Clipdate the below. initial guess of n, say to guess 2 Camilarity n = 1 2 (0-1) + S %; /