Help.

Let G be a connected graph and u and v be two distinct vertices of G having odd degree. If the rest of vertices of G all have even degrees, then there must be a trail from u to v that passes every vertex of G at least once and travels every edge of G exactly once. True False Question 4 (4 points) Saved Select ALL true statements in the following: (Grading: Right minus Wrong selections.) For all integers rand s, if ris even, s is odd, then 5r +2s is odd. For all positive integers rand s, r + 2rs + s is composite. For every integer p, if P is prime then p - 1 is even. 217.01001000100001... is a rational number. (The decimal pattern continues forever) The cube of any rational number is a rational. Question 5 (3 points) For all sets A, B, and C, (A U B UC) = An BnCc. O True False