Binary Search 1. Suppose that that we have an array called list initialized as follows: int[] 1ist f-2, 8, 13, 22, 25, 25, 38, 42, 51, 103): This would construct the following array [0 1 3 [4 [5] [6 7 8 [9] I -213 22 1 25 I 25 38 421 51 103 Note that the method calls below is of the form: binarySearch(int[] a, int low, int high, int target) a) What values would low, high and mid take on for the following call: binarySearch (list, 0, 9, 103) and what value would be returned? b) What values would low, high and mid take on for the following call: binarySearch (1ist, 2, 8, 30) and what value would be returned