Freshers India

Consider the following list.
list = {5, 11, 25, 28, 45, 78, 100, 120, 125};
Suppose that a binary search as discussed in the book is used to determine whether 28 is in list. Exactly how many key comparisons are executed by the binary search?                         

Consider the following list.
list = {5, 11, 25, 28, 45, 78, 100, 120, 125};
Suppose that a binary search as discussed in the book is used to determine whether 110 is in list. Exactly how many key comparisons are executed by the binary search?                         

Consider the following list.
list = {5, 11, 25, 28, 45, 78, 100, 120, 125};
Suppose that a 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 function, terminates?                         

Consider the following list.
list = {5, 11, 25, 28, 45, 78, 100, 120, 125};
Suppose that a binary search as discussed in the book is used to determine whether 110 is in list. What are the values of first and last when the while loop, in the body of the binarySearch function, terminates?                         

Suppose that L is a sorted list of length 1000. To determine whether an item is in L, the maximum number of comparisons executed by the binary search algorithm, as discussed in this book, is                         

Consider the following statement.
double alpha[10][5];
The number of components of alpha is