Walks, Paths and Connectivity · Easy problem

A graph has three pieces with no edges between them: one of size $2$, one of size $3$, and one of size $4$ (for instance, a single edge, a triangle, and a path of $4$ vertices). What is the minimum number of edges that must be added to make the whole graph connected?