What subsets of a finite universal set do these bit

Solution:

Step 1:

In this problem we have to define the subsets of bit strings .

Definition : A bit string is a sequence of zero or more bits , which is defined by 0 or 1. A bit string’s length is the number of bits in the string.

If we define the universal set U  and then assign a bit number to each subsets A as follows . A bit is 1 , if the element corresponding to the position of the bit in the universal set is in A  and otherwise 0.