# Question: let g v e w be a weighted undirected...

###### Question details

Let G = (V, E, w) be a weighted undirected graph. Let U be a subset of V , such that G[V − U] is connected. Design an algorithm to find a minimum spanning tree of G in which all vertices in U are leaves. Note that the spanning tree may have other leaves, but the weight of the tree should be minimized.(pseudo C code)