In c++ programming

A) Binary search works on [unsored arrays, sorted arrays or both]. Pick one from []. b Complete the following binary search function. Fill in A through F. This function returns the index where key is found or -1 if key is not found. ar is an array already sorted in ascending order. size is the size of the array. key is the number being searched for. int binarysearch(const int ar[], int size, int key) { int I = ;//A int r = ; //B int m; while (l