The Minimal Spanning Tree Algorithm Is Considered a Greedy Algorithm

question 12

Multiple Choice

The minimal spanning tree algorithm is considered a greedy algorithm that,when taking the best action at each stage,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.