Let G be a graph with 7 vertices such that every vertex is adjacent to every other vertex, and having no multiple loops or edges. Which of the following is true?
◦ G has an Euler path, but not an Euler circuit.
◦ G has an Euler circuit.
◦ G has a bridge.
◦ All of these are true.
◦ None of these are true.