Below is a recursive version of binary search: int binarySearch(int nums[], int low, int high, int target) {  if (low > high)  return -1;  int mid = (low + high)/2;   if (target == nums[mid])  return mid;   else if (target < nums[mid])  return binarySearch(nums, low, mid - 1, target);  else  return binarySearch(nums, mid + 1, high, target); } For the 4 statements below, indicate whether you think it is True or False. If you like, you  can provide a description of your answer for partial credit in case you are incorrect. 1) The code “if (low > high) return -1;” is a base case for this function 2) The code “int mid = (low + high)/2;” is a base case for this function 3) The code “if (target == nums[mid]) return mid;” is a base case for this function 4) The code “else return binarySearch(nums, mid + 1, high, target);” is a base case for  this function

What will the final values of count1 and count2 be in terms of n? assume that n is a power of 2 of the form 2^r.

Exercise 1 Given the following recursive version of selection sort:public void recursiveSelectionSort(int a[], int n, int index){if (index == n)return;int k = minIndex(a, index, n-1);if (k != index)swap(a, k, index);recursiveSelectionSort(a, n, index + 1);}minIndex is a separate function that finds the smallest value in the given array “a” from“index” to “n-1” index values.swap is a separate function that swaps elements in the given array “a” between theelements at index “k” and “index” respectively.Assuming these 2 functions work as expected, there may be an error with therecursiveSelectionSort code. Answer the following:1) Design your own set of 8 unsorted integers in an array2) Determine what the given code will produce with your array by describing what thearray looks like with each recursive instance of recursiveSelectionSort3) If the code does have an error, describe the error, where it is, and how you would fixitFor example, if you said your array was [4 2 3 1 5 6 7 8], then…

Complete the combinations function to generate all combinations of the characters in the string s with length k recursively