The following questions concern the bisection method. You should assume that the method does not get lucky and ends up with ( i ) = 0. (a) How sensitive is the bisection method to the width of the...

The following questions concern the bisection method. You should assume that the method does not get lucky and ends up with(

_i
) = 0.

(a) How sensitive is the bisection method to the width of the initial interval? For example, in Table 2.2, if the initial interval is cut in half, what is the expected reduction in the number of iterations?

(b) Both

₁() =

³
− 2 and

₂() =


^x

− 5 sin(
³) − 3 cos() have one zero in the interval 0
<>
₁() = 0, how many will it likely take to solve

₂() = 0?