- This question should be answered on the sheet provided.
A College wants to connect the computerised registration equipment at its six sites, \(A\) to \(F\). The table below shows the cost, in pounds, of connecting any two of the sites.
| A | B | C | D | \(E\) | \(F\) |
| A | - | 130 | 190 | 155 | 140 | 125 |
| B | 130 | - | 215 | 200 | 190 | 170 |
| C | 190 | 215 | - | 110 | 180 | 100 |
| D | 155 | 200 | 110 | - | 70 | 45 |
| E | 140 | 190 | 180 | 70 | - | 75 |
| F | 125 | 170 | 100 | 45 | 75 | - |
Starting at \(D\), use Prim's algorithm to find a minimum connector and draw the minimum spanning tree. Hence, state the lowest cost of connecting all the sites.
(5 marks)