1. Create a graph with four odd vertices
2. Create a graph with seven vertices, a bridge, and a loop.
3. For the following floor plan, determine whether it is possible for a person to walk through each doorway without using any of the doorways twice. If it is possible, determine such a path.