There are 6 cities of which each is connected to every other city. How many different routes one can trace from a to b such that no city is touched more than once in any one route?
a. 60
b. 120
c. 360
d. 720