(assuming simple labled graphs - (no loops, multiple edges, etc...))

Let G be a complete graph on n verticies.

A) How many spanning subgraphs does G have?

B) How many induced subgraphs does G have?

Explain.