$1$

CONTINUED

$($b$)(7$ pts$.)$ Use the greedy algorithm to find an approximate solution to the traveling salesman problem for a circuit starting at vertex $E,$ and find the weight of this circuit. Also, write down the edges in the order that you choose them when constructing the circuit as you apply the Greedy Algorithm.