Number all your edges in the graph $1, 2, 3, \dots,$ etc. The order does not matter, but every edge must have a number.
Draw an Euler circuit through your graph: a path that traverses each edge exactly once. Consult pages 392, 393, 394 in the text if necessary.
Describe your Euler circuit by writing down the sequence of numbers corresponding to the edges in the order you traverse them.
Remember: Collaboration is fine, but what you hand in should be your own graph. Handing in something you copied is plagiarism and will cost you if it is detected. Write down what you tried and how it worked.
Hand in your work at the recitation meeting (Mon, Wed or Thur)