Walks, Paths and Connectivity · Easy problem

A graph on vertices $1,\ldots,8$ has edges $12,23,13,45,56,47,78$. How many vertices are in its largest connected component?