First version of the unique paths problem.

Recursion solution. Time complexity is expontential, in terms of the inputs, m and n.
Second version of the unique paths problem.

DP solution: maintain an 1xm array to keep intermediate results