(1 point) Are the following statements true or false? ? v 1. Any graph with an Euler trail that is not an Euler circuit can be made into a graph with an Euler circuit by adding a single edge. 2. If a graph has an Euler trail that is not an Euler circuit, then every Euler trail must start at a vertex of odd degree. 3. If a complete graph has an Euler circuit, then the graph has an odd number of vertices. 2 4. Every graph in which every vertex has even degree has an Euler circuit. v 5. Every graph with an Euler trail is connected