# Seatwork (Graphs 2) *Show your solutions* ![figure](https://i.imgur.com/yvCWdDV.png) 1. Provide one Euler circuit from graph G. 2. In graph G, what is the shortest distance from b to d? 3. The requirements for a graph to contain an Euler circuit are that (1) the graph must be connected, (2) every vertex must have an even degree. What are the requirements for it to have an Euler path?