Question 1145426
For any set, the number of subsets is  {{{ 2^n }}}, where n=number of elements in the set   <br>

For the posted problem, there are {{{2^4 = highlight(16) }}} subsets.<br>

One way to think about it:  when forming a given subset, as you scan through the elements of the set, you can choose to (1) include that element in the subset or (2) exclude that element from the subset, hence each element multiplies by two the number of possible subsets.
<br>

The number of of proper subsets is {{{ 2^n - 1 }}} as each subset must contain elements from the set, but not contain ALL of the elements of the set.  There is only one subset that has all the elements from the set, so the -1 subtracts that one out.   For the posted problem, there are 15 proper subsets.