-
4 cities are connected by a road network as shown in the figure. In how many ways can you start from any city and come back to it without travelling on the same road more than once?
-
- 8
- 12
- 16
- 20
Correct Option: B
According to question ,
It can be seen that every city is connected to all the other cities (i.e. 3 other cities).
Step 1: Let starting point is A, there are 3 ways in which we could proceed, viz. AB, AD or AC.
Step 2: Once we are at any of these cities (B, D or C), each one of them is connected to 3 other cities. But since we cannot go back to A the originating city, there are only 2 ways in which we could proceed from here.
Step 3: let us assume that we are at B, we can only go to D or C by taking BD or BC respectively. From this point we a choice of either directly going back to A (thus skipping 4th city or go to 4th city and come back to A. )
Step 4:- Now if we are at D, we can either take DA or DCA. So there are 2 more ways to go from here.
So , total number of ways = 3 x 2 x 2 = 12 ways.
