Amy has to visit towns b and c in any order the roads


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

Solution Preview :

Prepared by a verified Expert
Mathematics: Amy has to visit towns b and c in any order the roads
Reference No:- TGS01480917

Now Priced at $10 (50% Discount)

Recommended (95%)

Rated (4.7/5)