Problem $2(10$ points$)$

$-$ Task: Draw a simple, connected, directed graph with:

$-8$ vertices

$-16$ edges

$-$ An in$-$degree and out$-$degree of $2$ for each vertex

$-$ Additional Requirement: Show that there exists a single $($non$-$simple$)$ cycle that includes all edges of your graph. This means you should be able to trace all edges in their respective directions without lifting your pencil $($known as an Euler tour$).$