How much time did you spend on this assignment? The (ordered) degree sequence of a graph G is the list of the degrees of its vertices listed in weakly decreasing order. (a) Let A be the degree sequence of some Simple graph. Show that A is not a self-conjugate integer partition. (b) Let A be the degree sequence of some simple graph. Show that A cannot have distinct parts. (I.e., Show there must be two parts that are equal)