1.consider the following list: 5, 12, 25, 32, 38, 46, 58, 62, 85, 90, 97, 105, 110 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. 32
b. 20