Show that if P=NP then there in algorithm A running in polynomial time which takes as input a graph G and which outputs a largest independent set I in G. (Largest means having the most pairwise independent vertices possible, and it may not be unique.)