Sets can be represented using bit strings. 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 0s. For example: A={1,2,3,4} can be represented using the bit string: 111100000000 B={5,6,9,11} can be represented using the bit string: 000011001010 Represent the following sets using bit strings: C={2xxZ+,x4} D={yyZ+,8y11} C DC DC CD