Answer:
84 possible paths
Step-by-step explanation:
Given
--- 3 blocks north
--- 6 blocks east
Required
Number of distinct path
To solve this question, we make use of the following formula
The above formula implies that;
On a single path, there is a total of m + n steps to get to a particular position, where each path is either in m direction or n direction.
In this case:
So, we have:
Apply combination formula
Expand the numerator
Expand the denominator
<em>Hence, there are 84 possible paths</em>
<em></em><em> will also give the same result</em>