Given an integer A, find and return the
number of paths in a grid of size (A x A) that starts from (1, 1) and reaches (A, A) without crossing the major diagonal.
Since the result can be large, return the result modulo (10^9 + 7).
The only argument given is integer A.
Return the number of paths modulo (10^9 + 7).
1 <= A <= 10^6
Input 1: A = 2 Output 1: 1 Input 2: A = 5 Output 2: 14
NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a doubt? Checkout Sample Codes for more details.