Trees · Medium problem

A network connects vertices $1$ through $10$ with cables $12, 23, 34, 45, 26, 67, 78, 49, 9\text{-}10$. What is the length (in cables) of the LONGEST path between any two vertices in this network?