Peter the Postman has to deliver packages to 6 different locations. Being in a hurry, Peter decides to use the Sorted Edges Algorithm to reduce his travel distance as much as possible. The table below represents the distances (in miles) between all the locations. Use the Sorted Edges Algorithm to find a Hamiltonian circuit that minimizes Peter's travel distance. Draw lines to complete the Hamiltonian circuit on the diagram below. You do not need to find the total distance. You do not need to show your work. Peter ABCDE Peter - 13 12 11 9 10 A 13 - 6 17 5 7 A B 12 6 - 14 4 8 C D 9 5 E 10 7 8 00 11 17 14 4 16 - 15 18 15- 16 18 B Peter 0 E D