Given a square grid, how could you determine the number of possible paths from the top left of the grid to the bottom right, assuming you can only move to the right and down? For example: There are 6 paths to the bottom in a 2 by 2 grid. How many such routes are there through a 20�20 grid? Result :
source not stored for this graph (policy: none)
nothing calls this directly
no outgoing calls
no test coverage detected