Add.
+ 
A. 
B. 
C. 
D. 
Answer: D
You might also like to view...
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
Find factors or multiples as indicated for the number or numbers given.List the first 5 multiples of 10 starting with 0 ? 10 = 0
A. 1 ? 10 = 10; 2 ? 10 = 20; 3 ? 10 = 30; 4 ? 10 = 40; 5 ? 10 = 50 B. 0 ? 10 = 10; 1 ? 10 = 10; 2 ? 10 = 20; 3 ? 10 = 30; 4 ? 10 = 40; 5 ? 10 = 50 C. 0 ? 10 = 0; 1 ? 10 = 11; 2 ? 10 = 12; 3 ? 10 = 13; 4 ? 10 = 14; 5 ? 10 = 15 D. 0 ? 10 = 0; 1 ? 10 = 10; 2 ? 10 = 20; 3 ? 10 = 30; 4 ? 10 = 40; 5 ? 10 = 50
Solve the problem.Alan walked 
mile to the store and then another 2
miles to his friend's house. How far did he walk?
A. 
miles
B. 2
miles
C. 
miles
D. 2
miles
Simplify.(
+ 7)2
A. y+ 14
+ 49
B. y+ 49
C. y2+ 14y + 49
D. y2+ 14
+ 49