Prove the following languages are NP-complete Let G be an undirected graph. VERTEX-COVER = {〈G, k〉 G is an undirected graph that has a k-node vertex cover } where a vertex cover is a subset S of the nodes of G where every edge (vi, v2) of G either vi S or v2 E S. . SUBSETSUM = { 〈S, t〉 IS-(n , . . . , rk } and for some Show transcribed image
OR
OR