Consider the graph given above. Add an edge so the resulting graph has an Euler circuit (without repeating an existing edge). ______

Use Fleury's Algorithm to find an Euler circuit through the graph using this new edge by listing the vertices in the order visited. ________