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.

---

Definitions:

Polypropylene

A thermoplastic polymer made through the polymerization of propylene, used in packaging, textiles, and various types of containers.

Carbonate Ester

An organic compound formed by the reaction of a carbonate ion with an alcohol, often used as solvents and intermediates in chemical synthesis.

Glass Transition Temperature

The temperature range over which a polymer changes from a hard, glassy state to a soft, rubbery state.

Polymer

A large molecule or macromolecule composed of many repeated subunits.