Simple Eulerian graphs

Click on the edges in proper order to get Eulerian path.
For the existence of Eulerian trails it is necessary that zero or two vertices have an odd degree. If there are exactly two vertices of odd degree, all Eulerian trails start at one of them and end at the other.

Decide whether these graphs are Eulerian or not.

Decide whether these graphs are Eulerian or not.
Image