Euler Graphs

Which of the following is / are Euler Graphs?Select one:a.b.c.d.

The necessary and sufficient condition for a graph to be Eulerian is:a.All vertices have even degreeb.All vertices have odd degreec.All vertices have the same degreed.There is a path between every pair of vertices

For which of the following combinations of the degrees of vertices would the connected graph be Eulerian?Select one:a.1,2,3b.2,3,4c.2,4,5d.1,3,5

If a graph is Eulerian, then it must be:a.Connectedb.Disconnectedc.Planard.Bipartite

Show that all vertices of an Euler graph G are of even degree