5 [Figure 1, printed on the insert, is provided for use in this question.]
The network shows the times, in minutes, to travel between 10 towns.
\includegraphics[max width=\textwidth, alt={}, center]{4a186c87-5f84-4ec3-8cc3-a0ed8721b040-05_412_1561_568_233}
- Use Dijkstra's algorithm on Figure 1 to find the minimum time to travel from \(A\) to \(J\).
(6 marks) - State the corresponding route.
(1 mark)