Let G be a graph. A clique in G is a subgraph in which every two nodes are connected by an edge. An anti-clique, also called an independent set, is a subgraph in which every two nodes are not connected by an edge. Show that every graph with n nodes contains a clique or an anti-clique with at least 21log2n nodes. NOTE: This uses an important computer science principle you learned about in other courses. You don't need induction, and while this too requires careful thinking, the proof is surprisingly short. Think more, write less