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. 4 */ 5 public static boolean binarySearch (int[ ] data, int target, int low, int high) { 6 if (low > high) 7 return false; // interval empty; no match 8 else { 9 int mid = (low + high) / 2; 10 if (target data (mid]) 11 return true; // found a match 12 else if (target