Given an undirected graph $G = (V,E)$ and a positive integer $g > 0$, is there a vertex cover using at most $g$ vertices, if so what is it?