A network of roads connects locations T, O, W, N, and S. How many different routes are there to travel from T to W along the given roads (line segments) without retracing any part of the route or going to any town more than once per route?

Answer:
9 routes
Step-by-step explanation:
every time you make a route, you can make a symmetrical route on the other side.