What will be the base case in the function of binary search used in the code of binary insertion sort? (high and low are the rightmost and leftmost index of array respectively and item is the element whose correct position is to be determined by the binary search function)

A.

If(high<=low) 
{ 
    If(Item>a[low])
    return low+1;
    return low;
}

B.

If(high>=low)
{
    If(Item<a[low])
    return low+1;
    return low;
}

C.

If(high<=low)
{
    If(Item<a[low])
    return low;
    return low+1;
}

D.

If(high<=low)
{  
    If(Item>a[low])
    return low;
    return low+1;
}

Answer: Option C