Walks, Paths and Connectivity · Challenge problem

A town has $8$ junctions. What is the fewest roads (each joining two distinct junctions) such that closing any single road still leaves every junction reachable from every other?