Please provide proof of correctness as well. Suppose you are given an integer k and an array A[1 .. n] of n distinct integers, sorted in increasing order. Describe and analyze a recursive algorithm to determine whether there is an index i such that A[i] = i + k in O(log n) time.