From city A to B there are 3 different roads. From B to C there are 5....
To solve this problem, we can break it down into smaller steps and calculate the number of possibilities at each step.
Step 1: Laxman's journey from city A to D
- Laxman has to go from city A to D, attending some work in city B and C on the way.
- There are 3 different roads from A to B, 5 different roads from B to C, and 2 different roads from C to D.
- Therefore, there are 3 * 5 * 2 = 30 different ways for Laxman to travel from A to D.
Step 2: Laxman's journey from D to A
- Laxman has to come back in the reverse order, attending some work in city C and B on the way.
- However, he has to take a different route while coming back than he did while going.
- From D to C, there are 2 different roads.
- From C to B, there are 5 different roads.
- From B to A, there are 3 different roads.
- Therefore, there are 2 * 5 * 3 = 30 different ways for Laxman to travel from D to A.
Step 3: Total number of possibilities
- To calculate the total number of possibilities, we need to multiply the number of possibilities from step 1 with the number of possibilities from step 2.
- Total number of possibilities = 30 * 30 = 900.
Therefore, the correct answer is option 'D', 870.
From city A to B there are 3 different roads. From B to C there are 5....
Ans is 240