For a graph to be euler graph every vertex in the graph should have have even degree in graph G1 all the vertices have odd degree so no euler circuit possible therfore g1 is not euler graph.
Graph G2 has vertex a ,d,e all these vertex have odd degree as 3 ,5,3 so here no euler ciruit possible .no this graph is also not euler graph .
So (c) option ans.