< binarySearchMC1 binarySearch1 CodeStepByStep Main Page Exercises Java Solve an Exercise Language/Type: Related Links: Java binary search searching Wikipedia: binary search Suppose we are performing a binary search on a sorted array initialized as follows: // index 0 1 2 3 int[] numbers = {-5, -1, 0, 3, 4 5 6 7 8 9 10 11 12 13 14 9, 14, 19, 24, 33, 41, 56, 62, 70, 88, 99}; int index = binarySearch (numbers, 18); 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. O You passed 2 of 2 tests. # question your answer result 1 indexes examined 7, 3, 5, 6 pass 2 value returned -1 pass indexes examined 7, 3, 5, 6 value returned -1 Submit Need help? Stuck on an exercise? Contact your TA or instructor. If something seems wrong with our site, please contact us. i imninder binarySearch2>