6 The network opposite shows some roads connecting towns. The number on each edge represents the length, in miles, of the road connecting a pair of towns.
- Use Dijkstra's algorithm on the network to find the minimum distance from \(A\) to \(J\).
- Write down the corresponding route.
- The road \(A J\) is a dual carriageway. Ken drives at 60 miles per hour on this road and drives at 50 miles per hour on all other roads.
Find the minimum time to travel from \(A\) to \(J\).
\includegraphics[max width=\textwidth, alt={}]{d666b2d9-cb14-4d29-a842-8c87f1b25dbd-15_2487_1714_221_152}