Consider the number of subsets of a set with nelements. Use the fact that there are C(n,k) subsets of k elements with 0<=k<=n and the Binomial Theorem to show that there are (1+1)^n = 2^n subsets. (Hint: write out the Binomial theorem for x=1 and y=1.)