Recursive binary search is an efficient searching technique used to locate an element in a sorted array. It works by repeatedly dividing the array into two halves and comparing the target element with the middle element. If the target matches the middle element, the search is successful. If the target is smaller, the search continues in the left half; otherwise, it continues in the right half. The recursive approach repeatedly calls the same function until the element is found or the search interval becomes invalid. The given sorted array is: 10 35 40 45 50 55 60 65 70 100 The target number to be searched is 100. The recursive binary search algorithm can be implemented as follows in C language: ```c #include int binarySearch(int arr[], int low, int high, int key) { if(low <= high) { int mid = (low + high) / 2; if(arr[mid] == key) return mid; else if(arr[mid] > key) return binarySearch(arr, low, mid - 1, key); else return binarySearch(arr, mid + 1, high, key); } return -1; } int main() { int arr[] = {10, 35, 40, 45, 50, 55, 60, 65, 70, 100}; int n = 10; int key = 100; int result = binarySearch(arr, 0, n - 1, key); if(result != -1) printf("Element found at index %d", result); else printf("Element not found"); return 0; }