Ordinary Differential Equations Question Help!!!

- Suppose we apply the Forward Euler method to numerically approximate the solution to the NP :1: y = 1 + 1:4 so) = 1 over the interval 0 S a\" <_ how large should our step count n be to ensure a global error of less than i.e. if the numerical iterates are yr i="0,1,." . panel endpoints sci="D" hi :1: d and true solution is y nd value> I] such that N > N\" ensures Vi = U,1,...,N, |y rm 5 103. You may use the global error bound for Forward Euler without proof. Justify your choices of M and L carefully. +1 bonus point if your N\" value is less than 2000