3 The following network shows the lengths, in miles, of roads connecting nine villages, \(A , B , \ldots , I\). A delivery man lives in village \(A\) and is to drive along all the roads at least once before returning to \(A\).
\includegraphics[max width=\textwidth, alt={}, center]{d666b2d9-cb14-4d29-a842-8c87f1b25dbd-06_1072_1027_548_502}

1. Find the length of an optimal Chinese postman route around the nine villages, starting and finishing at \(A\).
2. For an optimal Chinese postman route corresponding to your answer in part (a), state:
   1. the number of times village \(E\) would be visited;
   2. the number of times village \(I\) would be visited.