2. A d-regular graph is a simple, undirected graph in which every vertex has degree d. (a) Draw a 3-regular graph with 5 vertices, or prove why it is...

All the requirments are in the picture..............................

2. A d-regular graph is a simple, undirected graph in which every vertex has degree d.(a) Draw a 3-regular graph with 5 vertices, or prove why it is impossible.(b) Draw a 3-regular graph with 6 vertices, or prove why it is impossible.(c) For which values of n > 3 is it possible to draw a 3-regular graph with n vertices?(d) For which values of d does a d-regular graph with 10 vertices have an Eulerian cycle?(e) For which values of d does a d-regular graph with 10 vertices have an Eulerian path that isnot a cycle (i.e. it starts and ends at different vertices)?