Find the Maximum Value of on [0, 1] $\le$

Multiple Choice

Find the maximum value of on [0, 1], where f(x) = , and use it to obtain an upper bound for the absolute value of the error involved if the Trapezoid Rule approximation based on n equal subintervals is used to approximate I = dx. How large should n be chosen to ensure that the error does not exceed ?

A) $\le$ 2 on [0, 1], $\le$ , n = 10 will do
B) $\le$ 1 on [0, 1], $\le$ , n = 8 will do
C) $\le$ 1 on [0, 1], $\le$ , n = 8 will do
D) $\le$ 2 on [0, 1], $\le$ , n = 9 will do
E) $\le$ 2 on [0, 1], $\le$ , n = 15 will do