1.
| Art | Biology | Chemistry | Drama | English | French | Graphics |
| Art (A) | - | 61 | 93 | 73 | 50 | 48 | 42 |
| Biology (B) | 61 | - | 114 | 82 | 83 | 63 | 58 |
| Chemistry (C) | 93 | 114 | - | 59 | 94 | 77 | 88 |
| Drama (D) | 73 | 82 | 59 | - | 89 | 104 | 41 |
| English (E) | 50 | 83 | 94 | 89 | - | 91 | 75 |
| French (F) | 48 | 63 | 77 | 104 | 91 | - | 68 |
| Graphics (G) | 42 | 58 | 88 | 41 | 75 | 68 | - |
The table shows the travelling times, in seconds, to walk between seven departments in a college.
- Use Prim's algorithm, starting at Art, to find the minimum spanning tree for the network represented by the table. You must clearly state the order in which you select the edges of your tree.
(3) - Draw the minimum spanning tree using the vertices given in Diagram 1 in the answer book.
- State the weight of the tree.