Neelam rides her bicycle from her house at A to her office at B, taking the shortest path. Then the number of possible shortest paths that she can choose is
Explanation:
We can find the number of shortest possible paths from A to E either by trial and error or by using combinations.
Note that to travel from A to E, we have to take 2 roads to the right and 2 roads downwards (in the diagram) in order that we follow the shortest path. In other words, we have to use 2 + 2 = 4 roads, out of which 2 are towards right and 2 are downwards.
This is equivalent to selecting 2 things (roads towards right) out of 4 things (roads). (The remaining two roads will be downwards.)
The number of ways of doing this is 4C2 = 4!/(2!×2!) = 6
∴ From point A to E, there are 6 ways to reach with the minimum distance travelled.
Here E to F is the shortest distance because the third side of a triangle is always less than the sum of the other two sides.
From point F to B, there are 6C4 = 6!/(4!×2!) = 15 ways to reach with the minimum distance travelled.
∴ There are 15 × 6 = 90 shortest paths that Neelam can choose.
Hence, option (d).
» Your doubt will be displayed only after approval.
Help us build a Free and Comprehensive Preparation portal for various competitive exams by providing us your valuable feedback about Apti4All and how it can be improved.