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

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