Problem #3 For each subpart below, draw a graph with the described properties or explain why such a graph does not exist. A An acyclic graph where every pair of nodes has an edge. B An undirected graph with degree sequence (4,3,2,2,1) C An undirected graph with degree sequence (4,3,2,1)/nD E A graph which contains no cycles but is not a tree. A connected graph with 10 vertices and 4 edges.

Fig: 1

Fig: 2