C++ please :)

Implement a recursive function that conducts a binary search with the following interface:

bool BinarySearch (int info[ ], int x, int fromLoc, int toLoc);

// info[fromLoc, toLoc] stores an ordered list

// x -- a search item

// if x is in the list, return true; otherwise, return false

Test cases:

int info[1000];

for(int i=0; i< 1000; i++)

info[i] = i;

cout << BinarySearch(info, 1030, 0, 999) << endl;

cout << BinarySearch(info, 993, 0, 999) << endl;