this is python

5 3 points Consider a first order differential equation y' = f(t, y), y(0) = yo. Let h be the time step in Euler's method. If we reduce the step size h then select all True statements: V the number of computations required to approximate the solution y(t) on the interval [0, 1] increases. the number of computations required to compute one of Euler's method increases. V the error in our approximation yN decreases V the error in our approximation y1 decreases hod y1 with step size h = expect the error E = 0.0126 interval [0, 1] with step size we expect: (1) > yN