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 second to last?
A. CD or EF
B. BC
C. AF
D. BH, EG or DE
E. none of these
Answer: A
Mathematics
You might also like to view...
Solve the problem.In a town whose population is 3000, a disease creates an epidemic. The number of people, N, infected t days after the disease has begun is given by the functionN(t) = 
. Find the number of infected people after 10 days.
A. 2000 people. B. 2737 people C. 142 people D. 1000 people
Mathematics
Find the square root.- 
A. -128 B. Not a real number C. 16 D. -16
Mathematics
Graph the function.f(x) = -
A. 
B. 
C. 
D. 
Mathematics
Find the axis of symmetry of the given function.f(x) = 7 - 2x2 + 7x
A. x = 
B. x = 
C. x = - 
D. x = - 
Mathematics