Basic Problem 3.3. Use the Havel-Hakimi algorithm to decide if the given sequences are graphic or not. Justify your answers. For any that are graphic, provide a realization of the sequence that clearly illustrates its degree sequence (meaning, it should be easy for me to verify). (a) 7, 7, 5, 5, 4, 3, 3, 2 (b) 7, 5, 5, 4, 4, 3, 2, 1 (c) 7, 7, 5, 5, 4, 3, 2, 1 (d) 7, 7, 5, 5, 5, 4, 3, 2