Study each of the 6 graphs provided. For each graph, find a Eulerian Path if one exists (i.e., a path for which each edge can be traversed exactly one time). Next, find a Hamiltonian Path if one exists (i.e., a path that visits each point exactly once).