Five of the campuses in the University of Texas system would like to establish a high-speed telephone and data network between the campuses. The campuses are located in the following cities: Brownsville, Dallas, El Paso, San Antonio, and Tyler. The map below gives the approximate distances in miles between these five campuses.

(a) Use Kruskal’s algorithm to determine the minimum-cost spanning tree that would link the five campuses to create the telephone and data network with the shortest distance. 

(b) If it costs $1875 per mile to install the network, how much will it cost to produce the network determined in part (a)?

Transcribed Image Text:

Dallas 98 Tyler 636 734 333 275 El Paso 553 San Antonio 548 /537 831 278 Brownsville