Consider the graph given above. Use the sorted edges algorithm to find
a Hamiltonian circuit.
a. List the weights of the edges separated by commas in the Hamiltonian
circuit in the order they are chosen as specified by the algorithm.
b. What is the total weight along the Hamiltonian circuit?
You can earn partial credit on this problem.