given a 3x3 matrix and every cell has a specific weight, need to find the path with minimum cost from (0,0) to (2,2), only right and down advance is possible and advancing c
