(b) Combinatorics County has seven towns: Algorithm, Binomial, Enumeration, Heuristic, Matching, Network and Simples. The following table gives the distances in miles) between them, where each town is referred to by its first letter. A B E H M N S 23 10 30 57 68 75 B23 21 39 45 63 67 E 10 21 21 48 59 66 H30 39 21 45 47 54 M57 45 48 45 24 24 N 68 63 59 47 24 11 S 75 67 66 54 24 11 Find a minimum spanning tree connecting these seven towns, using: (1) Kruskal's algorithm; (2) Prim's algorithm, starting with Matching. Your answers should make it clear how each algorithm is being applied, and which edge is added at each stage. This is particularly important if you use the tabular method for Prim's algorithm. IF