Question

'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?'

Answer 1

We need a diagram to answer this question.

Answer 2

I put a diagram to answer this question.

Answer 3

And thank you!!!!!!!!!!!!!!

Answer 4

And for this problem how do you do it ?
8. 230 + 230 + 230 + 230 =

A. 8120
B. 830
C. 232
D. 230
E. 226

Answer 5

1st Q, 8 paths
second Q, really?

Answer 6

@RanandoOnley for second question, is there any information else? where does it come from?

Answer 7

for the first question, @ehuman gave you the correct answer.