Walks, Paths and Connectivity · Easy problem

A graph has a central vertex $1$ joined to three separate paths of length $2$: $1\text{-}2\text{-}3$, $1\text{-}4\text{-}5$, and $1\text{-}6\text{-}7$ (edges $12,23,14,45,16,67$). How many cut vertices does this graph have?