For each of the following, either draw a graph satisfying the given criteria or explain why it cannot be done. Your graphs should be simple, i.e. not having any multiple edges (more than one edge between the same pair of vertices) or self-loops (edges with both ends at the same vertex). a. A graph with 3 connected components, 11 vertices, and 8 edges. b. A graph with 3 connected components, 10 vertices, and 30 edges. c. A graph with 3 connected components and 10 vertices. 9 vertices have degree 3 and 1 vertex has degree 4. d. A graph with 6 vertices, of which 4 have degree 3, 1 has degree of 4 and 1 has degree 5.