Trees · Easy problem

A network connects vertices $1$ through $6$ with cables $12, 23, 34, 45, 56, 61$ (a $6$-cycle) plus one extra cable $25$. What is this network's circuit rank — the fewest cables that must be removed to leave a spanning tree?