Minimum Spanning Tree

write algorithm IsMinSpanningTree(G, T), that will take a

graph G=(V, E) and a tree T=(V, ET) and returns true if T is an

MST in G graph. where MST is minimum spanning tree.

Sample Solution