Please suggest the method to crack these questions
- Attachments
-
- A) 6
B) 8
C) 10
D) 14
E) 16
Answer C
-
- Answer C
The second ques is the problem of combinations.
It is given in the figure that there are 4 streets and 3 avenues.
so the longest route will be calculated as : 5!/3! 2! = 10 ways.
I hope u understand i am very bad at explaining.
