Consider the following array with exactly 15 elements:
1,2,3,4,5,6,7,8,910,11,12,13,14,15
Suppose we are doing a binary search on the array. Circle all
elements that would not be found after examining three numbers if
we were searching for the value of the target element using binary
search. (An element is considered "examined" if it is compared
against the value being searched for.)