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 `A->B->C->A` and `A->C->B->A` are different

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 the same road more than once ? (The order in which he visits the cities also matters. e.g., the routes A rarr B rarr C A and A rarr C rarr B rarr A are different).

A road network as shown in the figure connect four cites. In how many ways can you start from any city (say A) and come back to it without travelling on the same road more than once ?

There are two routes joining city A to a city B and three routes joining B to another city C . In how many ways can a person perform a journey from A to C ?

A road network as shown in the figure connect four cites.In how many ways can you start from any city (say A) and come back to it without travelling on the same road more than once?

Five cities A,B,C,D,E are connected to each other by straight roads. What is the total number of such roads?