need asap

= 5. Sets and bipartite graphs (2 points) Let S {a,b,c} be a set containing three elements. We define a graph G = (V, E) on eight vertices. Each of the eight subsets x C S of S is (the label of) a vertex in G. The edge set E contains the edge (u, v) if u Cv and (u) = \v- 1. (The notation |v| denote number of elements in the subset v.) 1. Draw the graph G. Explain your construction. 2. Show that G is bipartite