Given an m ×n matrix in which each row and column is sorted in ascending order, design an algorithm to find an element.

Algorithm Description: We are given a Matrix (say A) of size m x n, whose elements are: $$\begin{pmatrix} a11 & a12 & a13 & ...... & a1n \\ a21 & a22 & a23 & ...... & a2n \\ ...... & ...... & ...... & aij & ...... \\ am1 & am2 & am3 & ...... & amn \...