Consider the following algorithm for the trapezoidal rule:

GIVEN:

STEP $1$:

the limits of integration a and $b$

the integrand $f$

the number of subintervals $n$

STEP $2$: compute $h=\frac{b-a}{n}$; and initialize sum to $0$ for i from $1$ to $n-1$

add $2f(a+ih)$ to sum

STEP $3$:

add $f(a)$ and $f(b)$ to sum

OUTPUT:

$(\frac{h}{2})$ sum

Compare the number of arithmetic operations required by this algorithm to the number of operations required by the algorithm presented in the text.