1. (6 points) Explain the basics of the concept of recursion... 1. Consider the following data field and method private intl arr precondition: aEr contains no duplicates the elements in arr are in sorted order, 10 low high) return low; else if (arr[mid]num) return mystery (mid+1, high, num) else if (arr [midnum) return mystery(low, mid-, num) i else return mid arr [mid]um What is returned by the call mystery(0, arr.length-1, num)? (A) The number of elements in arr that are less than num (B) The number of elements in arr that are less than or equal to nunm (C) The number of elements in arr that are equal to num (D) The number of elements in arr that are greater than num (E) The index of the middle element in arr 2. Consider the following method. /precondition:x public void mystery(int x) System.out.print(x 10); E x7 10) -0) mystery(x7 10) System.out.print (x10) Which of the following is printed as a result of the call mystery 1234)? (A) 1441 (B) 3443 (C) 12344321 (D) 43211234 (E) Many digits are printed due to infinite recursion