Question 11. What is the time complexity of the above recursive implementation of binary search?

Question 12. Consider the following code:#includeint recursive_sum(int n){      if(n == 0)        return 0;      return ________;}int main(){    int n = 5;    int ans = recursive_sum(n);    printf("%d",ans);    return 0;}Which of the following lines is the recurrence relation for the above code?

Question 13. Consider the following recursive implementation to find the sum of digits of number:#includeint recursive_sum_of_digits(int n){      if(n == 0)        return 0;      return _________;}int main(){      int n = 1201;      int ans = recursive_sum_of_digits(n);      printf("%d",ans);      return 0;}Which of the following lines should be inserted to complete the above code?

Question 14. Consider the following recursive implementation used to reverse a string:void recursive_reverse_string(char *s, int left, int right){     if(left < right)     {         char tmp = s[left];         s[left] = s[right];         s[right] = tmp;         _________;     }}Which of the following lines should be inserted to complete the above code?