Suppose you have an undirected graph G-(V, E) with distinct edge weights w(u, v). Define T as the maximum weight spanning tree of G (the spanning tree of G with maximum total weight). Let S be the subset of edges created by including the maximum incident edge for each vertex. (a) Provide a greedy algorithm for computing the maximum spanning tree T (b) Give an example of a graph with at least 4 vertices where
OR
OR