Problem 3. Graph Q2. Match the graphs with their descriptions. DAG [Choose] a graph that has nodes that can be colored in only two colors and there is no node connected to any node of the same color Bipartite graph a graph that has edges represented by sets, not tuples a graph that has as many vertices as edges a directed graph without cycles Directed graph a graph that has edges represented by tuples, not sets a graph that does not have edges a graph with cycles Undirected graph.