Problem 1 Divide and Conquer in O(log(n)) (33 points) Given an array A[n] whose elements are odd numbers (positive and negative). Suppose that n is a power of 2, the elements in A[n] are sorted and distinct. Design an algorithm to check whether there is at least one element in the array satisfies A(i) = 2i + 5, where 1