This graph has either an Euler path or an Euler circuit. Find one, and describe it by listing the edges in the order you use them.  (You will not simply use them in numerical order, but if, for example, you wanted to begin by using edges 1, 2, and 6, your answer would begin like this: 1, 2, 6, ...)

Question 5 options:

Question 6 (3 points)

Explain why we rarely use the Brute Force Algorithm for finding Hamilton Circuits.

Question 6 options: