Question

Five cities A. B, C, D
and E are connected to
each other as shown. If
a person has to reach A
from A to E in shortest
time he should travel
via
(A) city B
(В)cityC
(C) city D
(Dany of the above

​

Answer 1

Explanation:

There are five cities A, B, C, D, E on a certain island. Each city is connected to every other city by road. In how many ways can a person starting from city A come back to A after visiting some cities without visiting a city more than once and without taking same road more than once? (The order in which he visits the cities also matters: e.g. the routes

and

are different