Question

Let you are given an array of nine elements in non decreasing order. If you want to implement binary search on the given array of elements then the number of comparisons per successful search on the average will be
a) 3.21
b) 2.78
c) 3
d) 2