this is my question. thanks

Question 5 ((3+3+2+5+2+3+2) = 20 marks) a) Let A, B, C and D be connected graphs containing no loops and no multiedges. Let the nodes of A be {a,, a,, a;, a,, as, a; ) , let the node of B be {b,, b2, by, b,,b,, b; } etc. Let A and B both have six nodes and eight edges. i) Draw possible graphs A and B such that A and B are not isomorphic. ii) For your choice of graphs, clearly describe why they are isomorphic. Let C be a graph with five nodes and nine edges ifi) Draw C as a planar graph. iv) Verify that Euler's formula holds for this planar representation. Let D be a tree with ten nodes. V) Draw a possible graph D. vi) For your choice of graph, define the two disjoint subsets of D which show that D is bipartite