Question $4$: SEERVADA PARK has recently been set aside for a limited amount of sightseeing and backpack hiking. Cars are not allowed into the park, but there is a narrow, winding road system for trams and for jeeps driven by the park rangers. This road system is shown $($wout the curves$)$ in Fig. $9\mathrm{.}1,$ where location $O$ is the entrance into the park; other letters design.t$.$ the locations of ranger stations $($and other limited facilities$).$ The numbers give the distances of these witding roads in miles. The park contains a scenic wonder at station T$.$ A small number of trams are used to transport sightseers from the park entrance to station $T$ and back. The park management currently faces three problems. Determine which route from the park entrance to station $T$ has the smallest total distance for the operation of the trams.