Question

There are 6 cities, and every city is connected to each other. How many different routes can one trace from a to b, such that no city is touched more than once in any one route?


a) 72


b) 65


c) 60


d) 48


answer:

b.65

Answer 1

b is right option. ....

Answer 2

Answer:

65

Step-by-step explanation:

let us take the 6 cities as A,c,d,e,f,B

It has 4 routes i.e, c,d,e,f

By

0 city =1 route

1 city=4 routes

2 cities=4*3=12 routes

3 cities=4*3*2=24 routes

4 cities=4*3*2*1=24 routes

total=1+4+12+24+24=65 routes