(a) (2 marks) A simple undirected graph without loops which has 11 vertices, where 7 of the vertices have degree 4, and 4 of the vertices have degree 7. (b) (2 marks) An undirected graph with 12 vertices where 5 of the vertices have degree 2, 3 of the vertices have degree 5, and 4 of the vertices have degree 3. (c) (3 marks) An undirected simple graph without loops with 9 vertices and 38 edges. (d) (3 marks) An undirected simple graph without loops on 8 vertices, where 2 of the vertices have degree 5. Moreover, this graph cannot contain any cycles