2. Make the given graph G as a complete graph $K_n$ by joining all non adjacent vertices. Then obviously $K_n$ contains $G$ as an induced subgraph upto isomorphism.