If you perform a binary search on an array of one million integers, which of the following is closest to the number of elements that the search algorithm will need to examine?

a. All 1,000,000 of the integers

b. Roughly 3/4 (750,000) of the integers

c. Roughly half (500,000) of the integers

d. Roughly 1/10 (100,000)

e. Less than 1% (10,000 or fewer)