Subsets [ml={1,2,..,n} Power set:2rl ={SSC [n]} 2= Combinatorial proof: A subset S [n]corresponds to a string of n bit, where bit i indicates whether ie S.Subsets Combinatorial proof: Power set: [n] = {1, 2,...,n} ￾ ￾ ￾ 2[n] ￾ ￾ ￾ = A subset S ✓ [n] corresponds to a string of n bit, where bit i indicates whether i 2 S. 2[n] = {S | S ✓ [n]}