Or write your own Binary Search C Program Using recursion with the help of this below c program for binary search. they are: Using iterations− this means using a loop inside the function that checks for the equality of the middle element. #include using namespace std;int search(int elem, int size, int arr[]){ size = size - 1; static int low = 0; static int high = size; int mid = (low+high)/2; if(arr[mid] == elem) { return mid; } else if(size == 0) { return -1; } else { if(elem > arr[mid]) { low = mid + 1; search(elem, (size/2), arr); } else { high = mid - 1; search(elem, mid, arr); } }}int main(){ int arr[] = {10, 12, 15, 20, 25, 35, 46, 50, 80, 100}; for(int i = 0; i < 10; i++) cout<