Exercise 1.18 (A multicut formulation of the MST problem) Given an undirected graph G = (V, E), with IV = n and E = m, consider a partition of V into disjoint nonempty sets Co, Ci, ...,Ck of nodes, whose union is V. Let 8(Co, C1, ...,Ck) be the set of edges, whose endpoints lie in different sets Ci. Let Pmcut = {ver" eEE os te si, xe = n-1, Xe > k, for all k ee(Co,C1,...,Ck) and for all partitions Co,C1,...,Ck of ...Corv} Prove that Pmcut Psub, where Psub XER" eEE 0 k, for all k ee(Co,C1,...,Ck) and for all partitions Co,C1,...,Ck of ...Corv} Prove that Pmcut Psub, where Psub XER" eEE 0