I am looking at an exercise about the vertex cover. We are given the graph $G=(V,E)$ with $V=[100]$ and $E=\{(i, i+1)\mid i=1, \dots , 99\}$.
Before I use the approximation algorithm, I have to give the minimal vertex cover $C^\star$ of $G$ and the length of $C^\star$.
How do we find the minimal vertex cover without the approximation algorithm? The vertex cover has to contain at least one vertex of each edge, right? At the given graph, each vertex is connected with the consecutive one, so do we maybe take for example the first one, then the third one, etc?