(Solved) : Given Undirected Graph G V E Integer K Clique G Subset V V Vertices Pair Connected Edge E Q35718534 . . . .

Given an undirected graph G = (V, E) and an integer k. A cliqueof G is a subset V’ ⊆ V of vertices, each pair of which isconnected by an edge in E. The Clique problem asks whether Gcontains a clique of size at least k. An independent set of G is asubset V’ ⊆ V of vertices such that each edge in E is incident onat most one vertex in V’ . The Independent-Set problem asks whetherG’ contains an independent set of size at least k’ . We proved inclass that the Clique problem is NP-complete. Show that theindependent