I am having troubles with the functions involved in this question

ciude ng namespace std; t binarySearch t main() const int SIZE- 10; (const int all, int s, int key): int ar[SIZE] - I1, 10, 20, 30, 40, 50, 60, 70, 80, 90); int key: cout > key; //Call binarySearch ) here and show the answer as the sample run. return 0: //This function returns the index where key is found or -1 if key is //a an integer array of any size. /is is the size of the array. //key is the number being searched for. int binarySearch (const int all, int s, int key) int 1 2?2: //left boudary starts at first index int r 22?2: //right boundary starts at last index int m; //middle point between left and right. //when 1 and r cross over, earch ends.--> key was not found. while(???27 /Icalculate the middle point between 1 and r 22?? if (???2?2???) //key was found bu