The trouble with the error estimates is that it is often very difficult to compute four derivatives and obtain a good upper bound for by K | f (4)(x) | hand. But computer algebra systems have no problem computing f(4) and graphing it, so we can easily find a value for K from a machine graph. This exercise deals with approximations to the integral l = ∫2π f, where. (a) Use a graph to get a good upper bound for | f”(x)| (b) Use M10 to approximate l. (c) Use part (a) to estimate the error in part (b).

a (d) Use the built-in numerical integration capability of your CAS to approximate l

(e) How does the actual error compare with the error estimate in part (c)?
(f) Use a graph to get a good upper bound for | f(4) (x)|.
(g) Use S10 to approximate l.
(h) Use part (f) to estimate the error in part (g).
(i) How does the actual error compare with the error estimate in part (h)?
(j) How large should be to guarantee that the size of the error in using Sn is
less than 0.0001?