I need help writing the Matlab code for fixed position for problem 6.

Matlab, this function is predefined as besselj (0,x). We will call or, ab-, . the positive roots of Jo (x), sorted in an increasing order (1) Show that the fixed points of g(x)-2Jo(x) +z are exactly the roots of Jo(z) (2) Plot g(). You can use Matlab and either print the plot or faithfully reproduce it on paper by hand (3) We plan to calculate a using the fixed-point iteration Will rn converge to Answer graphically, without calculation (4) It looks like we will not be able to calculate a2 with the same method. Argue why, again, graphically (5) We decide to change g(x) into g(x)-2Jo(x) +r, and to use Will rn converge to a2 now? MAE 3100 COMPUTATIONAL METHODS-HW 3 (6) Calculate a4 to 4 decimal places, that is with ea