Describe an algorithm to solve the following problem. Given a $2$D binary matrix

based index$)$ of dimensions NxM$.$ Find the minimum number of steps required to reach

from $(0,0)$ to $(x,Y).$ Note: You can only move left, right, up and down, and only through

cells that contain $1.$

Illustrate the working of your algorithm over the following example input:

$A=\left[\begin{array}{cccc}1& 1& 1& 0\\ 1& 0& 1& 1\\ 1& 1& 1& 1\\ 0& 1& 0& 1\end{array}\right]$