1.

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» C. 60


Discussion

No Comment Found

Related MCQs