Let G be a graph with n ≥ 3 vertices that has a clique of size n-2 but no cliques of size n 1. Prove that G has two distinct independent

sets of size 2.