Math, asked by HarshaR4710, 10 months ago

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

Answers

Answered by addagirisai5955
2

Answer:

option C

Step-by-step explanation:

mark me s brainliest

Similar questions