Let G be a complete graph on n vertices.
a. How many spanning subgraphs does G have?
b. How many induced subgraphs does G have?