The Graphical Republic has six towns: Arc, Bicentre, Centre, Digraph, Edge and Forest. The following table gives the distances (in kilometres) between them, where each town is referred to by its first letter. A B C D E F A 23 18 36 42 43 B 23 21 24 50 31 18 21 21 37 36 D 41 35 36 24 21 42 50 37 41 E 19 F 43 31 36 35 19 (i) Find a minimum spanning tree connecting these six towns, using: (1) Kruskal's algorithm; (2) Prim's algorithm, starting with Arc