Consider the graph given above. Use the nearest neighbor algorithm to find the Hamiltonian circuit starting at vertex T.

a. List the vertices in the Hamiltonian circuit in the order they are visited. Do not forget to include the starting vertex at both ends.

b. What is the total weight along the Hamiltonian circuit?