determine whether the graph is Eulerian.If it is, find Eulerian circuit. if it is not explained why? if the graph does not have a Euler circuit, does it have a Euler path? If so, find one. if not explain why?

[tex] \huge \color{purple}\implies {\mathcal {Answer}} [/tex]
A. 4 odd vertex, Not Eulerian
B. 4 odd vertex, Not Eulerian
C. Not Connected,Not Eulerian
D. 2 odd Vertex, Not Eulerian but has Euler Path
Sa Picture Yung sa D. Rude Daw Kasi