Exercise 4 (Vertex Cover and Set Cover) Consider the following two problems: Vertex Cover Input: An undirected graph G = (V,E) Output: A subset of the vertices S CV such that every edge has an endpoint in S Goal: Minimize |S Set Cover Input: A set of n elements B; sets Si,.. , Sm CB Output: A selection of the S, whose union is B Goal: Minimize the number of sets picked (i) What are the search versions of Vertex Cover and Set Cover? (i) Describe a reduction from the search version of Vertex Cover to the search version of Set Cover