4 Paulo sells vegetables from his van. He drives around the streets of a small village. The network shows the streets in the village. The number on each edge shows the time, in minutes, to drive along that street. Paulo starts from his house located at vertex \(A\) and drives along all the streets at least once before returning to his house.
\includegraphics[max width=\textwidth, alt={}, center]{5ee6bc88-6343-4ee6-8ecd-c13868d77049-10_1518_1605_598_198} The total of all the times in the diagram is 79.5 minutes.

1. Find the length of an optimal Chinese postman route around the village, starting and finishing at \(A\). (Shortest routes between vertices may be found by inspection.)
2. For an optimal Chinese postman route, state:
   1. the number of times the vertex \(F\) would occur;
   2. the number of times the vertex \(D\) would occur.
3. Toto is standing for the position of Mayor in the local elections. He intends to travel along all the roads at least once. He can start his journey at any vertex and can finish his journey at any vertex.
   1. Find the length of an optimal route for Toto.
      [0pt]
   2. State the vertices from which Toto could start in order to achieve this optimal route. [3 marks]