please read the question entirely

2. Consider anxn matrix. The elements in the rows of the matrix are in sorted order from left to right and the elements in the columns of the matrix are in sorted order from top to bottom. Find the k-ranked element (out of the n? elements) in O(n + k lg n) time (or better). Your method may use O(n) additional space