6 Given a graph G(V, E), its complement graph is a graph G(V, E) such that V= V. ave the same set O vertices, however, G'has an edge (u, v) if and only if G does not have edge (u, v) (a) Draw the complement graph V, E). for the following graph G (b) Suppose graph G(VE) has an Euler cycle and the number of vertices is an even number, M = 2k. Prove that its complement graph GV, E) cannot have an Euler cycle