The figure below shows the network connecting cities A, B, C, D, E and F. The arrows indicate permissible direction of travel. What is the number of distinct paths from A to F?
A
9
No worries! We‘ve got your back. Try BYJU‘S free classes today!
B
10
No worries! We‘ve got your back. Try BYJU‘S free classes today!
C
11
No worries! We‘ve got your back. Try BYJU‘S free classes today!
D
8
Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses
Open in App
Solution
The correct option is A 8 (B) The maximum routes from A to F are listed below. (1) ABDF (2) ACDF (3) ABF (4) ABEF (5) ACDEF (6) ABCDEF (7) ABDEF (8) ABCDF