New telephone lines must be installed to connect 9 cities (A, B, C, D, E, F, G, H and J). 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 second to last?
A. DE
B. BC
C. AB
D. EH
E. none of these
Answer: D
Mathematics
You might also like to view...
Graph the polar equation.r = 4 cos 6?
A. 
B. 
C. 
D. 
Mathematics
Solve the problem.A rectangular sheet of paper is 
by 
An area in the shape of a parallelogram with a height of 
and a base of 
is cut from the paper. How much area is left over?
A. 648 in.2 B. 1773 in.2 C. 1998 in.2 D. 2673 in.2
Mathematics
Determine if the proportion is true or false.
= 
A. False B. True
Mathematics
Solve the problem. Round amounts to the nearest cent and percents to the nearest tenth of a percent.Cost = $138.24; Rate of markup based on cost = 59%. Find the markup and selling price.
A. Markup: $234.31 Selling price: $372.55 B. Markup: $59.00 Selling price: $197.24 C. Markup: $197.24 Selling price: $335.48 D. Markup: $81.56 Selling price: $219.80
Mathematics