Walks, Paths and Connectivity · Challenge problem

A graph on $12$ vertices has exactly $4$ connected components. What is the largest number of edges it can have?