Determine whether the following statement is true or false. If the statement is false, make the necessary change(s) to produce a true statement. A graph that contains exactly three vertices, each of which is odd, is traversable. Question content area bottom Part 1 Choose the correct answer below. A. The statement is false. A similar true statement is a graph that contains exactly three vertices, with exactly one odd, is traversable. B. The statement is false. A similar true statement is a graph that contains exactly three vertices, each of which is even, is traversable. C. The statement is false. A similar true statement is a graph that contains exactly four vertices, each of which is odd, is traversable. D. The statement is true because all the vertices are odd