(a) Modify Kruskal's algorithm to determine an optimal tree of maximal weight.
(b) Interpret the information of Exercise 4 in terms of the number of calls that can be placed between pairs of cities via the adoption of certain new telephone transmission lines. (Cities that are not directly linked must communicate through one or more intermediate cities.) How can the seven cities be minimally connected and allow a maximum number of calls to be placed?