Q4 Part A: Solve the recurrence relation. Show your work. Give both, the exact answer and the general case. (so using the master theorem wont cut it since that wont give you the exact recurrence relation solution)

Q4: The following Function performs binary search for x on a given array arr. //arr is array, l is left index, r is right index, x is element to find int binarySearch (int arr[], int l, int r, int x) { if (r >= 1) { int mid = l + (r - l) / 2; // If the element is present at the middle by itself if (arr[mid] == x) return mid; // If element is smaller than mid, then // it can only be present in left subarray if (arr[mid] > x) return binarySearch (arr, l, mid - 1, x); // Else the element can only be present in right subarray return binarySearch (arr, mid + l, r, x); // We reach here when element is not present in array return -1