2. Modify the recursive binary search algorithm so that it returns the index of the target in the sequence, or returns -1 if the target is not found. 1 /** 2 Returns true if the target value is found in the indicated portion of the data array. 3. This search only considers the array portion from data[low] to data (high) inclusive. 5 public static boolean binarySearch (int[ ] data, int target, int low, int high) { if (low > high return false; // interval empty; no match else { int mid = (low high) / 2; if (target == data[mid]) return true; // found a match 12 else if (target