Walks, Paths and Connectivity · Medium problem

A graph on vertices $1,\ldots,7$ consists of two triangles sharing vertex $1$ — triangle $1,2,3$ and triangle $1,4,5$ — together with a separate edge $67$ having no connection to the rest. If vertex $1$ is deleted, how many connected components does the remaining graph have?