Sets can be represented using bit strings. For example, the universal set $U=\{0,1,2,3,4,5,6,7,8\}$ has bit string

representation: $111111111.$ 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:

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

$B=\{5,6\}$ can be represented using the bit string: $000001100$

Considering the universal set as above, represent the following sets using a list, and as a

bit$-$string, given:

$K=\{3x+2|xinZ\},K=$

$L=\{y|yin{Z}^{+},yis$ a factor $of30\},L=$

a$.K-L$

b$.\frac{?}{\text{b}\text{a}\text{r}}(K)L$