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

a. List the vertices in this 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 this Hamiltonian circuit?

Now use the sorted edges algorithm to find a Hamiltonian circuit.

c. List the weights in this Hamiltonian circuit in the order they are chosen by the algorithm.

d. What is the total weight along this Hamiltonian circuit?