(a) An Eulerian cycle in an undirected graph G (V, E) is a cycle that goes over each edge of E exactly once, although it may go through vertices multiple times. Show that G has an Eulerian cycle if and only if it is connected and all vertices have even degree