It turns out that neither the nearest neighbor algorithm nor the greedy algorithm gives a Hamiltonian circuit of minimum total weight starting at vertex E. Find some Hamiltonian circuit starting at...

Extracted text: It turns out that neither the nearest neighbor algorithm nor the greedy algorithm gives a Hamiltonian circuit of minimum total weight starting at vertex E. Find some Hamiltonian circuit starting at vertex E of total weight smaller than those of the circuits you found in parts (a) and (b). 25 21 22 13 24 19 10 18 D 11