Approximate solutions with explicit Euler steps
Use explicit (forward) Euler updates x[n+1]=x[n]+h and y[n+1]=y[n]+h f(x[n],y[n]). Evaluate each slope at the old point. Give exact values; do not round intermediate values
\[x_0=-1,\quad x_N=1,\quad N=4\]
Divide the interval into N equal forward steps. Give h, the number of updates, the number of stored points and x2