Walks, Paths and Connectivity · Easy problem

A graph on vertices $1,\ldots,7$ consists of a $5$-cycle $1\text{-}2\text{-}3\text{-}4\text{-}5\text{-}1$ with one extra pendant vertex $6$ attached to $1$ and another pendant vertex $7$ attached to $3$ (edges $12,23,34,45,51,16,37$). How many bridges does this graph have?