3. Following code segment is the JAVA implementation of Binary Search, int binarySearch (int arr[], int 1, int r, int x) ( if (r >= 1) 10 int mid= 1 + (r - 1)/2; if (arr[mid] x) return mid; if (arr[mid]> x) return binarySearch(arr, 1, mid-1, x); return binarySearch (arr, mid+1, r, x); return -1; } The time complexity of all divide-and-conquer algorithms can be expressed using following recurrence: ifn sc. aT(n/b) + D(n) + C(n) otherwise. T(n) = 9(1) Binary search is a divide-and-conquer algorithm, determine the values of constants a, b, and c, and the orders of growth of C(n) and D(n).