BJP4 Self-Check 13.21: binarySearch3 Favorite Language/Type: Java binary search searching Roy McElmurry (on 2016/09/08) Author: Suppose we are performing a binary search on a sorted array called numbers initialized as follows: // index 0 1 2 3 4 56 78 9 10 11 12 13 14 39, int[] numbers = {-1, 3, 5, 8, 15, 18, 22, 40, 42, 50, 57, 71, 73, 74); // search for the value 42 int index binarySearch(numbers, 42); = 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. indexes examined Sound F/X value returned