Problems 1 & 2: Use the graph on the right. E G D 1. Find a Hamilton PATH starting at G and ending at B. Answer by listing the vertices in the order you use them. 2. Find a Hamilton CIRCUIT starting at C and ending at C. Answer by listing the vertices in the order you use them. 3. BADEFC GB represents a Hamilton circuit. Re-write this Hamilton circuit so that it starts and ends at vertex E. 4. Of the four algorithms covered regarding Hamilton circuits, which algorithm will always result in the optimal Hamilton circuit? 5. Calculate 9! 6. How many Hamilton circuits are possible for a complete graph with 13 vertices