b) Let C' be any connected component in T', and let E" S E be the set of edges connecting C and V - C'. That is, E" = {(x,y) : (x,y) E E, X E C', y E V-C), i.e., including every edge (x, y) in G(V, E) such that the first node x is in C', and the second node y is not. This edge set E" is said to be the cut (C,V- C) of G playing an important role in computer science. Prove that the given edge e has the minimum weight among all in the cut (C, V-C')