Definition. Define the complement of a grap G = (V,E) (either directed or undi- rected) as the graph G = (V. E), where for every pair of distinct vertices v and w in V, (v,w) if and only if (v,w) E. Or, to look at another way: take the adjacency matrix for G and (ercept on the main diagonal) change each one to a zero and each zero to a one. The resulting matriz is the adjacency matrix for G 3.) Give an example of a simple undirected graph on four vertices which is isomorphic 4.) For n 2 3 let Cn be the undirected graph consisting of a simple cycle of length n. ((0, 1, 2, . . . , -1}, {{i, i + 1(mod n)} | 0-i-n-1}) to its complement Ca List all values of n such that Cn is isomorphic to its complement