Answer
Devising an algorithm similar to Prim’s algorithm for constructing a maximum spanning tree of a connected weighted graph.
Work Step by Step
--Instead of choosing minimum-weight edges at each stage,
--choose maximum-weight edges at each stage with the same
properties.
