Isomorphism and Subgraphs · Hard problem

Let $G$ have vertices $1,\ldots,7$. Vertices $5,6,7$ form a triangle, every one of $1,2,3,4$ is joined to all of $5,6,7$, and there are no edges among $1,2,3,4$. How many connected components does the complement $\overline G$ have?