An independent set of a graph G = (V, E) is a subset V' ⊆ V such that for any two vertices u, ∈ V'
the edge (u, v) ∉ E. The IndependentSet problem is to find a maximum-size independent set in G. Formulate a related decision problem and prove that it is NP-complete