Question 4. Assume you have an array A of n sorted elements. We need to decide whether or not it has a pair of elements A[i] and A[j],i=j, such that A[i]=A[j]. Write a pseudocode for a divide-and-conquer algorithm to solve the problem. What is the complexity of your algorithm? can you do better