Consider the following list:

$3,14,26,30,42,46,53,68,75,91,97,103,120,127,135$

Using the binary search as described in this chapter, how many comparisons are required to find

whether the following items are in the list? Show the values of first, last, and middle and the number of

comparisons after each iteration of the loop.

$($a$)42$

$($b$)91$

$($c$)5$