Walks, Paths and Connectivity · Medium problem

The complete graph $K_4$ on vertices $1,2,3,4$ has two extra pendant vertices: $5$ attached only to $1$, and $6$ attached only to $2$. How many cut vertices does this graph have?