human
Counts paths from a point to reach Origin | Recursive function to count number of paths.
If we reach bottom or top left , we are have only one way to reach ( 0 , 0 ).
Else count sum of both ways.
Driver Code"
Solution in Python:

Write me a code to counts paths from a point to reach Origin and the other steps required?
assistant
#Here is code to counts paths from a point to reach Origin and the other steps required.
 def countPaths ( n , m ) :
	if ( n == 0 or m == 0 ) :
		return 1
	return ( countPaths ( n - 1 , m ) + countPaths ( n , m - 1 ) )
n = 3
m = 2
print ( " ▁ Number ▁ of ▁ Paths ▁ " , countPaths ( n , m ) )