Fill in the code to complete the following method for binary search.

```
public static int recursiveBinarySearch(int[] list, int key) {
int low = 0;
int high = list.length - 1;
return __________________________;
}

public static int recursiveBinarySearch(int[] list, int key,
int low, int high) {
if (low > high) // The list has been exhausted without a match
return -low - 1; // Return -insertion point - 1

int mid = (low + high) / 2;
if (key < list[mid])
return recursiveBinarySearch(list, key, low, mid - 1);
else if (key == list[mid])
return mid;
else
return recursiveBinarySearch(list, key, mid + 1, high);
}```
a. recursiveBinarySearch(list, key)
b. recursiveBinarySearch(list, key, low + 1, high - 1)
c. recursiveBinarySearch(list, key, low - 1, high + 1)
d. recursiveBinarySearch(list, key, low, high)

d