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 (from least to most).
