Commit 5d9ebbb

@@ -5,3 +5,17 @@ Given the graph shown below, answer the following questions:
 1. Illustrate adjacency list representation and adjacency matrix representation, respectively, for this graph.
   * What are the advantages and disadvantages of those two representations?
 1. Describe an algorithm to find in the graph a path illustrated below that goes through every edge exactly once in each direction.
+
+
+```plaintext
+(a)---(b)---(c)---(d)
+ | \       /     /
+ |  \     /     /
+(e)  \(f)/  (g)/--(h)
+ |     |   / |    /
+ |     |  /  |   /
+(i)---(j)/  (k) / (l)
+ | \         | /   |
+ |  \        |/    |
+(m)  \(n)---(o)---(p)
+```