The graph represents five cities and the routes between them

An out of state inspector is asked to fly into Pottsville.

Inspector must inspect each road on the map, From Pottsville making only one trip along each road and then fly out of

Tinkertown .

Route map can be decided by the Eulers path theorem.

Eulers path  is a path that doesnot have back to track or pass by the same road twice. \ \

Eulers path theorem:  

Eulers path theorem. states that if a graph has exactly two vertices of Odd degree, then it has an Euler path that starts 

and ends on the Odd degree vertices.

Observe the graph:

Degree of eac vertices are and .

From the Eulers theorem, graph has two vertices of odd degree, then it has an Eulers path that starts with Pottsville

and ends with Tinkertown .

Route map can be .

(b)