Suppose we are performing a binary search on a sorted array called numbers initialized as follows: // index int [ ] numbers = {-30, -9, -6, -4, -2, -1, e, 2, 4, ie, 12, 17, 22, 30); /I search for the value -5 int index = binarySearch(numbers, -5); Write the indexes of the elements that would be examined by the binary search (the mid values in our algorithm's code) and write the value that would be returned from the search. Assume that we are using the binary search algorithm shown in lecture and section e 1 2 3 4 5 6 7 8 9 1e 11 12 13 indexes examined Sound F value returned