Consider the following list.

list = {5, 11, 25, 28, 45, 78, 100, 120, 125};

suppose that binary search as discussed in the book is used to determine whether 28 is in list. what are the values of first and last when the while loop in the body of the binarysearch method terminates?

a. first = 3, last = 3
b. first = 0, last = 3
c. first = 2, last = 4
d. none of these

consider the following list.

list = {20, 10, 17, 2, 18, 35, 30, 90, 48, 47};

suppose that sequential search as discussed in the book is used to determine whether 2 is in list. exactly how many key comparisons are executed by the sequential search algorithm?

a. 3
b. 4
c. 5
d. 8