Let G be an n-vertex simple graph, where n >= 2. Determine the maximum possible

number of edges in G under each of the following conditions.

(a) G has an independent set of size a.

(b) G has exactly k components.

(c) G is disconnected

Any ideas? Thanks