5. Consider the following two problems: VERTEX COVER: Given an undirected graph G = (V,E) and a positive integer k, is there a subset V C V of size at most k such that the graph G\V has size 0? DOMINATING SET: Given an undirected graph G = (V,E) and a positive integer k, is there a subset D S V of size at most k such that every vertex in G\D is adjacent to some vertex of D Show that DOMINATING SET is NP-complete by reducing from VERTEX COVE