Do exercise $13\mathrm{.}1$ page $392$ of the textbook, and use a graph drawing freeware to draw the graph you derive. Then, share your answer to the second question.

In this activity, you will be assessed on your ability to: Examine the applications of graphs in computing and other domains. Analyze the various representations of graphs and their properties. Investigate graph traversals, their properties, and their applications.

page $392,$ exercise $13\mathrm{.}1$: Draw a simple undirected graph G that has $12$ vertices, $18$ edges, and $3$ con nected components. Why would it be impossible to draw G with $3$ connected components if G had $66$ edges?