Definitions. Let G = (V, E) be a graph and for every X C V define X = V \\ X. Recall that o(X) = {xy E E | r E X and y E X } and that any set of this form is called an edge cut. Assuming G is connected, we say that an edge cut (X) = 6(X ) is a bond if both of the graphs G - X and G - X are connected. 1. For the cycle Cak, determine all possible sizes of edge cuts and all possible sizes of bonds