In a Minimal Spanning Tree Problem

Multiple Choice

In a minimal spanning tree problem:

A) If node 1 is connected to node 3, which is connected to node 5, the shorted path from node 1 to node 5 is 1-3-5.
B) The optimal solution is found by adding arcs of least distance until all nodes are connected.
C) The arcs between nodes 1 and 5, between nodes 1 and 9, between nodes 3 and 5, and between nodes 5 and 9 cannot all be included in the optimal solution.
D) The solution will include n arcs.