* A bond in a graph G is a minimal edge cut, i.e., an edge cut that does not contain a smaller edge cut. (a) Show that for S CV(G), 8(S) is a bond if and only if G-8(S) consists of exactly two connected components. (b) Prove that if e is an edge in two distinct bonds of G, then there is a bond of G not containing e. * A bond in a graph G is a minimal edge cut, i.e., an edge cut that does not contain a smaller edge cut. (a) Show that for S CV(G), 8(S) is a bond if and only if G-8(S) consists of exactly two connected components. (b) Prove that if e is an edge in two distinct bonds of G, then there is a bond of G not containing e