Write MATLAB code to solve the second-order Adams-Bashforth method. Please help! I have my current code as this:

n = 100; t_i=0; t_f=10; f = @(x) -x; % Analytical solution T = @(t) exp(-t); T_end = T(10); Err = zeros(1,length(n)); for j=1:length(n) h = (t_f - t_i)(j); t = t_i:h:t_f; x = zeros(1,n(j)+1); for i=1 x(1) = x(i) + h*f(x(i)); for i=2:n(j) x(i+1) = x(i) + h*(3*f(x(i)-f(x(i-1)))/2); end end end

4. Write Matlab code to solve the following multi-step IVP iteration, which we recall is the second-order Adams-Bashforth method (or AB2) that we discussed in class Here, use Euler's method to start the multi-step method, ie. let y1 y0 + hf(to, yo). Use this code to solve the IVP above using the same h and time span that you used for your Euler method approximation. Is this a good approximation of the analytical solution that you computed? You should see that for the IVP that we defined above, our second order AB2 method managed to produce a good approximation of our true solution where the midpoint method did not. However, this does not mean that the AB2 method doesn't suffer from the same issue