In each part, draw a (simple) graph G with the given properties or argue that no such graph exists. (a) G is a connected graph with 6 vertices and 5 articulation points. (b) G is a graph on 6 vertices with exactly two biconnected components. (c) G is a graph on n 1 vertices such that both G and its complement have an Euler trail. (Recall that the complement G' of G has the same vertex set as G, and e is an edge of G' if and only if it is not an edge of G.)