You will prompt the user for

1. x₀, y₀, and x₁.

2. The step size, n, to use.

You will output

1. The approximation for y_i+1.

Recall the procedure of the 4^th order Runge-Kutta method for a particular subinterval, [x_i,x_i+1].

1.
2.
3.
4.
5.
6.
7.
8.

You will break the interval [x₀,x₁] up into n equal length subintervals. For each subinterval, [x_i,x_i+1], use the 4^th order Runge-Kutta method to approximate the value of y_i+1 which you will then use in the next subinterval.

We discussed in class a simple algorithm for Euler's Method that you can adapt for the 4^th order Runge-Kutta Method.