A robot is located at the top-left corner of a 64 x 47 grid (marked ‘Start’ in the diagram below).
The robot can only move either down or right at any point in time. The robot is trying to reach the bottom-right corner of the grid (marked ‘Finish’ in the diagram below).
Note: The grid below is 7×3, and is used to illustrate the problem. It is not drawn to scale.

*Image not to scale.
How many possible unique paths are there?
