Simple disconnnected graph with 4 components

Question

Draw a simple disconnected graph, $G$, with $10$ vertices and $4$ components, and also calculate the maximum number of edges possible in $G$?

I have this question and I couldn't find the answer. Can someone offer helpful suggestions?.

Answer 1

HINT: Maximum number of edges can be obtained when graphs are complete graphs. So the question becomes: With $10$ vertices and $4$ components, how can we seperate the vertices so that complete graphs, say $K_a, K_b, K_c, K_d$, have maximum number of edges in total? How many edges does complete graph $K_n$ have?