Dynamic Programming - Min Cost Path Given a cost matrix cost[][] and a position (m, n) in cost[][], write a function that returns cost of mi