urgent solution needed using C++. detailed explanation of the code will be highly appreciated

2.The problem is to count all the possible paths from the top left to the bottom right of a M X N matrix with the constralnts that from each cell you can either move oaly to the right or down using dynamic programming In the input 22 represent the size of the matrix separated by a space and the output 2 indicates there are two paths namely: (0,0)(0,1)(1,1)(0,1)(1,0)(1,1) In the input 23 represent the size of the matrix separated by a space and the output 2 indieates there are two paths namely: (0,0)(0,1)(0,2)(1,2)(0,1)(0,1)(1,1)(1,2)(0,0)(1,0)(1,1)(1,2) Use the following algorithm to solve the problem: Declare a 2-D array of size N X M - Create a recursive function with parameters as row and column index and 2-D array - Call this recursive function for N1 and M1 - In the recursive function - If N=1 or M=1 then return 1 o If the value of this recursive function is not stored in the 2-D array then call the recursive function for (N1,M,dp) and (N,Ml,dp) and assign the sum of answers of these functions in the 2-D array and return this value else return the value of this function stored in the 2-D array - Print the