New telephone lines must be installed to connect 8 cities (A, B, C, D, E, F, G, and H). Due to government regulations, the only possible connections that are allowed are shown by the edges on the network below. The numbers on the edges indicate the cost (in millions of dollars) of each possible connection. The telephone company wishes to connect the cities in the cheapest possible way.
Using Kruskal's algorithm, which edge is chosen last?

A. AG
B. BH, EG or DE
C. BC
D. CD or EF
E. none of these


Answer: A

Mathematics

You might also like to view...

Determine whether the given equation is rational or non-rational.6 = 

A. Rational B. Non-rational

Mathematics

Solve the problem.The population of a city at the beginning of 2005 is 1,259,000. What will the population of the city be at the beginning of 2015 if it decreases by 2.4% each year? Round to the nearest whole number.

A. 1,011,752 B. 956,840 C. 987,470 D. 963,771

Mathematics

Find the annual liability premium for the coverage.A person's youthful-operator factor is 1.75. The annual premium for liability coverage is $207.30 for bodily injury and $174.90 for property damage.

A. $670.60 B. $668.85 C. $686.35 D. $382.20

Mathematics

Provide an appropriate response.The table shows the number of pupils per teacher in selected counties in a certain state. For which counties are the values not less than 12.5?

A. Addison, Branson, Cumberland, Dixson, Kendall, Putnum B. Hendricks C. Addison, Branson, Cumberland, Kendall, Putnum D. Dixson, Hendricks

Mathematics