This is for algorithms and data structure course

5. You are told that A is a 20 x 20 matrix with distinct positive integers. The values in each row are sorted and in increasing order (left to right). The values in each column are also in sorted increasing order (top to bottom). Suppose you cannot access A directly, and inspecting the value at even a single location is very expensive. Your goal is to tell whether a value k appears in the matrix A. Give an algorithm that is guaranteed to tell if k occurs in the matrix in at most 40 location accesses (i.e., accessing just 10% of the matrix entries). You may use any auxiliary data structures, but the main goal is to minimize accesses to A