Question

There are 3 places in a city namely A, B and C. There are 3 routes a1, a2 and a3 from A to B & there are 2 different routes, b1 and b2 from B to C. Find the number of ways he
can go from place A to C via B.

• A. 2
• B. 3
• C. 4
• D. 6

Answer 1

The correct option is D 6

(i) In the first way, he can go from A to B in 3 routes and
(ii) In the second way, he can go from B to C in 2 different routes.
Therefore, the total number of ways in which he can travel is 6 $(3\times 2$) routes.