Suppose you were using euler’s method to solve for some function starting from initial condition x(0) = 3 and propagating the solution to time t = 4. suppose you ran the algorithm with n = 100 steps, and that you believe the resulting error was approximately e100 ' 2 × 10−2 . approximately how many steps would you estimate would be required using euler’s method to drop the error to or less?