The question is:
Describe how you can find a spanning tree for which
(a) the product of the edge-costs is minimal
(b) the maximum of the edge-costs is minimal
Somebody has told me to use Jarnik-Prim Algorithm,but I still don't know how to solve the problem.