Several Ways


Count all possible paths from the top left to the bottom right of an M*N matrix. The constraints from each cell can either move to the right or down.

Write a function solve that have the following parameter(s):
1.) a = an integer indicating rows
2.) b = an integer indicating columns

Example
Input:
There is an integer given:
a = 3
b = 3
Output:
The function will return,
6

Explanation
Let the given input 3*3 matrix is filled as such:
1 2 3
4 5 6
7 8 9
The possible paths which exist to reach '9' from '1' following the above conditions are 12369, 12589, 14789, 14569, 14589, 12569.

Constraints
• The M and N will be greater than or equal to 1 and less than or equal to 10.