PYTHON 3

Follow instructions

#Comment steps please thank you

Write a function, numPaths(R, C), that returns the total number of distinct paths possible from the top left corner to the bottom right corner of a grid with R rows and C columns, assuming you can move right and down as well as diagonally. For example in a 2 by 2 grid there are 13 paths possible, which are:

Examples

numPaths(2, 2) = 13

numPaths(1, 1) = 3

numPaths(2, 3) = 25