1. Which statement about the Euler tour is correct: 1) The Euler tour is a circuit which traverses every edge of a graph exactly once, beginning and ending at the same point II) The Euler tour is a circuit which traverses every edge of a graph exactly once, beginning and ending at different points III) A graph possesses an Euler tour if and only if the graph contains no nodes of odd degree IV) A graph possesses an Euler tour if and only if the graph contains only nodes of odd degree II and III are correct I and III are correct II and IV are correct None of the above is correct I and IV are correct