You are given an n × n matrix A with unknown values and your goal is to find an entry that is a local maximum with smallest number of queries to individual entries. An entry Ai, j is a local maximum if it is not smaller than any of its neighbors (top, bottom, left or right if they exist) i. e. Ai, j = max{Ai, j , Ai−1,j , Ai, j−1, Ai+1,j , Ai, j+1}. You only need to find a local maximum, not the global maximum. Note that there may be multiple local maxima a recurrence for the number of queries and solving it. You don’t need to show your work for this part