Cumulative Worksheet 1. Determine if the graph contains an Euler circuit. If so, identify an Euler circuit on the graph by number- ing the sequence of edges in the order traveled. If not, explain. 2. Sort the edges from least to greatest. Apply the Sorted-Edges Algorithm to find a Hamiltonian circuit for the graph below. If an edge is not used, state the reason why (e.g., creates 3 edges at a vertex, closes circuit without all vertices). Find the cost. 10 16 20 15