Consider applying binary search to an array of N elements. After the k^th element has been examined, approximately how many elements are in the portion of the array that remains to be searched? A. N/2k B. N/2^k C. log N D. log k