Are the following statements true or false? ? 1. If a complte graph has an Euler circuit, then the graph has an odd number of vertices ? 2. Every graph in which every vertex has even degree has an Euler circuit False v 3. Every complete graph has an Euler circuit. ? 4. Every graph with a Hamilton circuit has a Hamilton path ? 5. If a tree has an Euler path, then the maximum degree in the tree is 2.