Write a recursive version of binary search in a sorted array A[1..n] search for a value, called key. 1.) 2.) 3.) What is the time complexity of the algorithm? Write the recurrence and solve with any method. Assume the array is implemented as a doubly linked list, i.e., no direct access to elements via indices. What is the resulting time complexity of the algorithm? Assume that the array passed in each recursive call is copied each time instead of being accessible for all calls. Would that alter the time complexity? Argue!