Given a rectangular grid of mn squares (m squares in a row and n squares in a column), find the number of ways (not number of steps) of going from the left top of the grid to the right bottom of the grid. A legal step is one unit to the right or one unit down.

Code it first using recursion and then using top-down dynamic programming.