Which of the following is false? A) Hamiltonian cycle can be converted to a Hamiltonian path by removing one of its edge. B) Every graph that contains a Hamiltonian cycle also contains a Hamiltonian path and vice versa is true. C) There may exist more than one Hamiltonian paths and Hamiltonian cycle in a graph. D) A connected graph has as Euler trail if and only if it has at most two vertices of odd degree