Let G = (V,E) be an undirected and unweighted graph that represents a network. You want to determine how vulnerable this network is. In order to determine the vulnerability of the network, you want to find the smallest subset of vertices K whose removal destroys all edges in the network. Let us call this the Edge- Destroyer problem. More formally, we say that a subset K of V is an edge-destroyer set of G if the deletion of K destroys all the edges of G, that is G[V - K] has no edges where GIV - K] is the induced graph on V - K Recall that the graph induced on a subset S of V, denoted GIS], is a graph that has vertex set S and an edge between two vertices u, v E S provided that fu, v is an edge of G. The decision version of this problem is to determine if there is an edge-destroyer subset of size k. Prove that the Edge-Destroyer problem is NP-complete