Is it possible disconnected graph has euler circuit? I have doubt !

Wikipedia says :


An Eulerian graph is one in which all vertices have even degree;
  Eulerian graphs may be disconnected.


What I know :

Defitition of an euler graph 
"An Euler circuit is a circuit that uses every edge of a graph exactly once. ▶ An Euler path starts and ends at different vertices. ▶ An Euler circuit starts and ends at the same vertex."
According to my little knowledge "An eluler graph should be degree of all vertices is even, and should be connected graph".
I am asking :Is it possible disconnected graph has euler circuit ? If it is possible show an example .
EDITED : Here is my suplimentary problem , I voted for the anwser .

Which of the following graphs has an Eulerian circuit?


It's only possible for a disconnected graph to have an Eulerian path in the rather trivial case of a connected graph with zero or two odd-degree vertices plus vertices without any edges. An Eulerian path for the connected graph is also an Eulerian path for the graph with the added edge-free vertices (which clearly add no edges that need to be traversed). Whoop-te-doo! The whole issue seems pretty nit picky and pointless to me, though it appears to fascinate certain Wikipedia commenters.
