5 The matrix shows the distances in miles between towns where direct routes exist.
| A | B | C | D | E | F |
| A | - | 22 | - | 12 | 10 | - |
| B | 22 | - | - | - | - | 13 |
| C | - | - | - | 6 | 5 | 11 |
| D | 12 | - | 6 | - | - | - |
| E | 10 | - | 5 | - | - | 26 |
| F | - | 13 | 11 | - | 26 | - |
- Draw the network.
- Use Dijkstra's algorithm to find the shortest route from A to F . Give the route and its length.
- Use Kruskal's algorithm to find a minimum connector for the network, showing your working. Draw your connector and give its total length.
- How much shorter would AD have to be if it were to be included in
(A) a shortest route from A to F ,
(B) a minimum connector?