Consider the following statements of approximation algorithm :
Statement $\text{I}$: Vertex-cover is a polynomial time $2$-approximation algorithm.
Statement $\text{II}$: $\text{TSP}$-tour is a polynomial time $3$-approximation algorithm for travelling salesman problem with the triangle inequality.
Which of the following is correct?
- Statement $\text{I}$ true and Statement $\text{II}$ false
- Statement $\text{I}$ and Statement $\text{II}$ true
- Statement $\text{I}$ false and Statement $\text{II}$ true
- Statement $\text{I}$ and Statement $\text{II}$ false
