A robot is located at the top-left corner of a m x n 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).
How many possible unique paths are there?
3 int small=m<n?m:n;
4 int large=m<n?n:m;
5 double a=1;
6 for(int i=1;i<small;i++)
8 return a;