(1) If G is a simple graph with n vertices, define its degree sequence to be the list of the degrees (di, . . . ,%) of its vertices in weakly increasing order (so di-d2--dn) (b) Prove that if G and H are isomorphic simple graphs, then their degree sequences (c) Show that the converse need not be true by finding two simple graphs on 6 (a) Prove that (di + d2++dn)/2 is the number of edges of G. are the same. vertices with degree sequence (2,2,2,2,2,2) which are not isomorphic to each other