Consider the connected graph G given by the following adjacency

list

a b$,$ h

b a$,$ c$,$ g$,$ j$,$ k

c b$,$ e$,$ f$,$ i

d e$,$ h$,$ i$,$ l

e c$,$ d$,$ k

f c$,$ k

g b$,$ h

h a$,$ d$,$ g$,$ j

i c$,$ d

j b$,$ h

k b$,$ e$,$ f$,$ l

l d$,$ k

Draw the graph, show that it is bi$-$partite, but that there is no complete matching $($using the Marriage Theorem$).$