Given a M x N matrix where each cell has cost associated with it, we need to find the minimum cost to reach last cell (M-1, N-1) of the matrix from its first cell (0, 0). We can only move one unit right or one unit down from any cell.
Given the below Matrix, what will be the minimum cost from (0, 0)  to (4,4).

{4  7  8  6  4}
{6  7  3  9  2}
{3  8  1  2  4}
{7  1  7  3  7}
{2  9  8  9  3}
 

Answer hidden