Question 6 (10 points; 5 points; 2 points; 3 points) Let A[1..n] be a sorted array of n integers, and x a positive integer. a) Design a O(n) recursive algorithm that returns i and j if there are two elements A[i] and A[j] such that i=j, whose sum is exactly x, otherwise it returns none. b) Find a recurrence relation that describes the number of element comparisons carried out by the recursive algorithm. c) Solve the recurrence relation and express the solution asymptotically