1. From your minimal spanning tree solution, the node(s) that is/are connceted to node 1 include:

A. Nodes 2 and 4

B. Nodes 3 and 4

C. Just node 2

D. Just node 3

2. From your minimal spanning tree solution, the nodes that are connected to node 4 include:

A. Nodes 1 and 7

B. Nodes 2,3,5, and 6

C. Nodes 1,2,3,5,6, and 7

D. Nodes 2,3,6, and 7

3. The path between node 4 and node 5 is included in the minimal spanning tree solution

A.True

B. False

4. From your minimal spanning tree solution, the node(s) that is/are connected to node 7 include:

A. Nodes 4 and 5

B. Just node 5

C. Just node 4

D. Nodes 4 and 6

5. The path between node 2 and node 5 is a redundant path and can be removed from consideration for this minimal spanning tree problem

A. True

B. False

6. When solving a minimal spanning tree problem, we must always begin with node1.

A. True

B. False

7. The number of branches required for the minimal spanning tree connecting these seven (7) nodes is six (6) branches

A. True

B. False

8. If the given network represents miles of network cable, the minimum number of miles of cable to connect all seven nodes is ........miles

9. The distance from node 1 to each of the remaining six nodes (nodes 2 through 7) has been minimized in this problem/model.

A. True

B. False