The Partial Binary Search Method Below Is Designed to Search

The partial binary search method below is designed to search an array of String objects sorted in ascending order. Select the expression that would be needed to complete the method. public static int search(String[] a, int low, int high, String item)
{
If (low <= high)
{
Int mid = (low + high) / 2;
Int result = ____________________________;
If (result == 0)
{
Return mid;
}
Else if (result < 0)
{
Return search(a, mid + 1, high, item) ;
}
Else
{
Return search(a, low, mid - 1, item) ;
}
}
Return -1;
}

A) a[low].compareTo(item)
B) item.equals(a[mid])
C) item.compareTo(a[mid])
D) a[mid].compareTo(item)