1. list two different paths you can take to get from New York to Athens. 2. you are flying from New York, and want to travel through at least 3 other cities and then return home. What are two different ways you can do this? 3. The paths you created in #2 are called _______, because they start and end at the same vertex. 4. what is the degree (or valence) of each vertex? New york: ___ London:______ Moskow:_____ Rio de janeiro:_______ Athens:_______ 5. How many odd vertices are in the graph?______ 6. use Euler's Theorem to analyze the graph. Does it have an Euler path? Does it have an Euler circuit? Explain how you know.