Walks, Paths and Connectivity · Challenge problem

A graph has vertices $1,\ldots,9$ and edges $12,23,34,45,26,67,48,89$. One extra edge, $79$, is added. How many bridges does the resulting graph have?