Please help with discrete structures

1.1Check the box if it's simple [2/ ea =8] 1.2If it isn't simple, draw a simple version by removing as few edges as possible [3/ea=6] 2 Draw the following graphs (see slides/textbook) [2/ea=8] a) K7 b) K4,4 d) C7 e) W7 3 For the following graphs attempt a two-colorization to show or refute that it's bipartite. [3/each = 6] Hint: Try it on a separate page first, it can get messy! 4 The complementary graph co(G) of a simple graph G has the same vertices as G. Two distinct vertices are adjacent in co((G) if and only if they are not adjacent in G. Draw the graph co(K2,3)[8]