Show with steps$/$working where needed

For example, the universal set $U=\{1,2,3,4,5,6,7,8,9,10,11,12\}$ has bit string representation:

$111111111111.$ When elements are missing in a subset of $U,$ we can replace the corresponding bits in

the bit$-$string with zeros. With such representation of a set the order of elements matters. For example:

$x=\{1,2,3,4\}$ can be represented using the bit string: $111100000000$

$Y=\{5,6,9,11\}$ can be represented using the bit string: $000011001010$

For Universal set $U=\{0,1,2,3,4,5,6,7,8,9\},$ and sets: is prime