Suppose you are given an n * n array where the elements are sorted in such a way that all elements in a row are in increasing order from left to right and all the elements in a column are in increasing order from top to bottom. Your goal is to search for a target value in this array. Give a divide and conquer algorithm to search for the target, and make the worst case as efficient as you can. Write the recurrence relation for the algorithm.