The streets in a city are arranged like the lines of a chess-board. There are six streets running north and south, and five streets running along east-west. Find the number of ways in which a man can travel from the north-west to the south-east corner, going the shortest possible distance.
1 | 2 | 3 | 4 | 5 |
2 | ||||
3 | ||||
4 |