Previous Problem Problem List Next Problem (1 point) Are the following statements true or false? False v 1. Every graph with an Euler path is connected True v 2. If Km,n has an Euler circuit, then m and n are both even. False v 3. Every bipartite graph has an Euler circuit. True v 4. Any graph with an Euler path that is not an Euler circuit can be made into a graph with an Euler circuit by adding a single edge True 5. Every graph in which every vertex has even degree has an Euler circuit