(2 points) Let VC denote the following optimization problem: given a graph, compute the size of the minimum-size vertex cover. Let VC-D denote the following decision problem: given a graph and a number k, decide whether or not there is a vertex cover of size at most k. True or False: if VC-D is polynomial-time solvable, then so is VC. True False