The total number of different ways he can get from Town A to Town D is
60 ways , Option A is the correct answer.
The way of selecting objects from a group of objects such that the order does not matter.
It is given that
There are 3 ways to get from Town A to Town B
The total number of ways he can select one route is ³C₁ = 3
There are 4 ways to get from Town B to Town C
The total number of ways he can select one route is ⁴C₁ = 4
There are 5 ways to get from Town C to Town D
The total number of ways he can select one route is ⁵C₁ = 5
The total number of different ways he can get from Town A to Town D is
3 * 4 * 5
= 60 ways
Therefore Option A is the correct answer.
To know more about Combination
https://brainly.com/question/13387529
#SPJ2
