Apply the Havel$-$Hakimi Theorem to demonstrate that the degree sequence $4,4,4,3,3,2$

is graphical, and consequently, construct two non$-$isomorphic graphs. Draw graphs as

necessary to illustrate your steps $($alongwith step descriptions$)$ as clearly as possible.