(1 point) Given a graph G = (V, E), a subgraph induced by vertex set S CV is a graph Gs = (S, E'), where (u, v) E E' iff ((u, v) e E and u ES and u ES). Prove or disprove: For any strongly connected, weighted, undirected graph G = (V. E) with distinct edge weights and any non-empty proper subset S of V such that Gs and Gy-s are strongly connected, MG) = MGS) + MGV-S) + we), where M.) denotes the weight of the minimum spanning tree, and w(e) is the weight of the minimum weight edge e = (u, v) such that u ES and v EV-S