3 The network shows distances between vertices where direct connections exist.
\includegraphics[max width=\textwidth, alt={}, center]{11c2d98f-1f72-4f1b-b971-5521bee09358-3_518_691_1742_687}
- Use Dijkstra's algorithm to find the shortest distance and route from A to F .
- Explain why your solution to part (i) also provides the shortest distances and routes from A to each of the other vertices.
[0pt] - Explain why your solution to part (i) also provides the shortest distance and route from B to F. [1]