C++ Data structures and algorithms

a) How many items will Binary Search examine at most when searching a sorted array of 921 elements? Show the array size at each step. (b) How large should this array be at least for Binary Search to require one more iteration (i.e., to examine one more item)? Justify your answer. (c) Apply Binary Search to the Sorted List below (an array of 12 elements) to try and find an item of key 'K'. Give the index values of the first, last, and midpoint elements of the sub-array that is searched at each step