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.
6
Open in App
Solution
The correct option is A 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×2) routes.