Trees · Easy problem

A ring network connects routers $1,2,3,4$ with exactly the cables $12, 23, 34, 41$ (a $4$-cycle, no diagonal). How many different spanning trees — ways to disconnect one cable and leave every router still reachable from every other — does this ring have?