3. Following code segment is the JAVA implementation of Binary Search, int binarySearch (int arr), int l, int r, int x) if (r >- 1) int mid- (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