Consider the recursive equation Xn+1 = Xn – h (F(Xn)-Xn), with initial condition X0 = 1 and h > 0 being a very small valued scalar. This recursion numerically solves the ordinary differential equation

Consider the recursive equation Xn+1 = Xn – h (F(Xn)-Xn), with initi

1.	Consider the recursive equation Xn+1 = Xn – h (F(Xn)-Xn), with initial condition X0 = 1 and h > 0 being a very small valued scalar. This recursion numerically solves the ordinary differential equation
A.	Ẋ = -F(X), X(0) = 1
B.	Ẋ = -F(X) + X, X(0) = 1
C.	Ẋ = F(X), X(0) = 1
D.	Ẋ = F(X) + X, X(0) = 1
Answer» C. Ẋ = F(X), X(0) = 1