Assume that the starting point of a path in such a grid is labeled the origin ≡ (0,0). the destination is the point (m, n). in other words, there are (n+1) streets in the x direction and and (m+1) streets in the y direction; and any portion of of any of these streets can be used to reach the destination. find the total number of distinct paths; assuming that all streets are available.