5. Find a Eulerian cycle in the graph below, starting from vertex 1. List vertices as they are visited by the cycle. 6. We say a graph G = (V, E) is bipartite if there exists V1 CV and V2 CV such that all of the following conditions hold: Vin V2 = 0 V U V2 = V V{u, u} E E, [(u e Vi Ave V2) (0 V AUE V2] Show that the following graph is bipartite by finding Vi and Vo which meet these conditions. Redraw the graph so that Vi is on the left and V2 on the right