How many languages over {0, 1} are there that contain only strings of length n?

Question

For example, if n = 1, then there are 4 languages: ∅, {0}, {1}, and {0, 1}.

Answer 1

There are $2^n$ strings of length $n$, so there are $2^{2^n}$ sets of strings of length $n$.