An independent set S of a graph G (V,E) is any subset of vertices SCV whereby no vertices in S are adjacent. (a) List all of the largest independent sets in C2, C4, C5, and C (b) Prove that the size of the largest independent sets of C, is n/2 when n is even Hint: Find an X C V of size n/2 that must be an independent set and explain why. Then show why X U Uk for any vertex vk cannot possibly be an independent set. Thus, X has to be the biggest independent set you can find