twice on the same trip

[sanju09]

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]

[outreach]

route no of ways
A - C =2
A -B =1
C - B =2

total =4

[selango]

8 ways