The Minimal Spanning Tree Algorithm Will

Multiple Choice

The minimal spanning tree algorithm will:

A) sometimes fail to produce a feasible solution.
B) always produce a feasible, but not necessarily optimal, solution.
C) always produce an optimal solution.
D) always produce an optimal, but not necessarily feasible, solution.