Help needed with Java Recursive!

Consider a network of streets laid out in a rectangular grid, there is no negative value, the smallest point is (0,0). For example (32) In a northeast path from one point in the grid to another, one may walk ONLY to the north (top) and to the east (right). For example, there are four northeast paths from A to B in the preceding grid Write a program that uses one or two recursive functions to 1) count the number of northeast paths from one point to another (user could input the values) in a rectangular grid, and 2) print out all the paths like: For example, there are 4 paths from (0,1) to (3,2)