Use the Route Inspection algorithm to find which paths, if any, need to be traversed twice.
It is decided to start the inspection at node \(C\). The inspection must still traverse each pipe at least once but may finish at any node.
Explaining your reasoning briefly, determine the node at which the inspection should finish if the route is to be minimised. State the length of your route.
(3)