DP: Given a matrix MxN find the count of all possible paths from upper left [0][0] corner to bottom down corner [M - 1][N - 1] you have move to the right or to the down.