4 [Figure 2, printed on the insert, is provided for use in this question.]
The network shows 11 towns. The times, in minutes, to travel between pairs of towns are indicated on the edges.
\includegraphics[max width=\textwidth, alt={}, center]{92175666-ef7a-4dca-9cdb-ebde1b40b2c9-04_1762_1056_516_484} The total of all of the times is 308 minutes.

1. 1. Use Dijkstra's algorithm on Figure 2 to find the minimum time to travel from \(A\) to \(K\).
   2. State the corresponding route.
2. Find the length of an optimum Chinese postman route around the network, starting and finishing at \(A\). (The minimum time to travel from \(D\) to \(H\) is 40 minutes.)