A network engineer lives in City A, and his job is to inspect his companys servers in various cities. The graph below shows the cost (in U.S. dollars) of travelling between each city that he has to visit.

Find a Hamiltonian path in the graph.

Find a Hamiltonian circuit that will allow the engineer to inspect all of the servers. How much will the cost be for his trips?

Is there another Hamiltonian circuit that will allow the engineer to inspect all of the servers other than your answer in question 4-b? If so, calculate the cost.

700 600 100 400 900 / 200 300