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.
The number of bridges in the optimal solution to this problem is
A. 9.
B. 8.
C. 0.
D. 7.
E. none of these
Answer: D
You might also like to view...
Write the expression in simplest form. If a radical appears in the denominator, rationalize the denominator.
A. 5xy
B. 5xy2
C. 5x
D. 5x2
Use the two steps for solving a linear programming problem to solve the problem.Bruce is bringing items to sell at a flea market, where he plans to sell televisions at 
each and DVD players at 
each. Due to space limitations he can only store at most 150 items for the day. However, because more people already own televisions, Bruce knows that the number of DVD sales must at least match the number of television sales. How many of each item should Bruce bring to the flea market to maximize his sales?
A. 25 televisions and 125 DVD B. 100 televisions and 50 DVD C. 75 televisions and 75 DVD players D. 50 televisions and 100 DVD players
Divide and simplify.
÷ 
A. 
B. 15
C. 
D. 
Simplify the expression. Express the answer so that only positive exponents occur. Assume that all variables are positive.
A. x209/84
B. x97/84
C. 
D. 