What is the number of unque subsets of a set with `n` elements

Question

eg: If I have $3$ elements in a set {$1,2,3$}, the number of ways I can make a subset out of them of the following type is: {$1$}, {$2$}, {$3$}, {$1,2$}, {$1,3$}, {$2,3$}, {$1,2,3$}

Answer 1

The answer is $2^n$ because you are missing the empty set. Here $n=3,2^n=2^3=8$ total subsets.

$$P(\{1,2,3\})=\Big\{\emptyset,\{1,2,3\},\{1\},\{2\},\{3\},\{1,2\},\{1,3\},\{2,3\}\Big\}$$