Please show the exact steps in detail, how to judge there is a unique simple graph and more than one non-isomorphic simple graphs?

(a) Show that up to isomorphism there is a unique simple graph with degree sequence (1, 1, 2, 3, 3) (b) Show that up to isomorphism there is a unique simple graph with degree sequence (2, 2, 2, 2, 2) (c) Show that there are two non-isomorphic simple graphs having degree sequence (1, 2, 2, 2, 3). (Hint : Start by constructing simple graphs having the given degree sequences. In the first two cases, show that such graphs can only be constructed in one way. In the third case, show there are at least two simple graphs having the given degree sequence, and then argue that any such simple graph must be isormorphic to one of them.)