Option (C) is correct.
Explanation:
A shortest route uses only east (E) and north (N) steps. A route is fixed once we decide which of its steps are north steps, so the number of routes with a east and b north steps is a+bCb.
A to P: 2 E and 1 N, so 3 steps with 1 of them north:
3C1=3
P to B: from (2, 1) to (5, 3) is 3 E and 2 N, so 5 steps with 2 of them north:
5C2=10
Every route through P is a route A to P followed by a route P to B, so by the multiplication principle:
3×10=30
Why the other options are wrong
- (A) 13=3+10 adds the two stages. Each of the 3 routes to P can be followed by each of the 10 routes from P, so the numbers must be multiplied.
- (B) 56=8C3 counts all shortest routes from A to B (8 steps, 3 north) and ignores the condition of passing through P.
- (D) 336=5!8! arranges the 8 steps and divides only for the 5 alike east steps. The 3 north steps are also alike (dividing by 3! as well gives 56), and the count still ignores P.