Which of the following statement/s is/are true or false? * Statement I: With Hamilton cycle, every edge must be used. Statement II: With Euler tour, every vertex must be used. Statements I and Il are...

Answer the following questions

Extracted text: Which of the following statement/s is/are true or false? * Statement I: With Hamilton cycle, every edge must be used. Statement II: With Euler tour, every vertex must be used. Statements I and Il are both True Statement I is True while statement Il is False Statement I is False while statement Il is True Both statements are False Which of the following is false? * Hamiltonian cycle can be converted to a Hamiltonian path by removing one of its edge. Every graph that contains a Hamiltonian cycle also contains a Hamiltonian path and vice versa is true. There may exist more than one Hamiltonian paths and Hamiltonian cycle in a graph. A connected graph has as Euler trail if and only if it has at most two vertices of odd degree