Amy has to visit towns B and C in any order. The roads connecting these towns with her home are shown on the diagram. How many different routes can she take starting from A and returning to A, going through both B and C (but not more than once through each) and not travelling any road twice on the same trip?
(A) 10
(B) 8
(C) 6
(D) 4
(E) 2
[spoiler]Source: majortests.com[/spoiler]
(A) 10
(B) 8
(C) 6
(D) 4
(E) 2
[spoiler]Source: majortests.com[/spoiler]
- Attachments
-
The mind is everything. What you think you become. -Lord Buddha
Sanjeev K Saxena
Quantitative Instructor
The Princeton Review - Manya Abroad
Lucknow-226001
www.manyagroup.com
Sanjeev K Saxena
Quantitative Instructor
The Princeton Review - Manya Abroad
Lucknow-226001
www.manyagroup.com












