Question 11
The diagram below shows a square network of roads, $A_1$, $A_2$, $A_3$ and $A_4$ are four intersections on the same diagonal. We want to go from $A_1$ to $A_4$ by going only to the east or to the south, without passing through $A_3$. How many different paths are there?
