Given an M × N matrix of integers whose each cell can contain a negative, zero, or a positive
value, determine the minimum number of passes required to convert all negative values in the
matrix positive.Only a non-zero positive value at cell (i, j) can convert negative values present at
its adjacent cells (i-1, j), (i+1, j), (i, j-1), and (i, j+1), i.e., up, down, left and right.