Consider the following languages over $\{0,1\}$ :

contains more $1\text{'}$s than $0\text{'}$s and $|w|3$

has an even number of $0\text{'}$s and $|w|3$

Enumerate the first $6$ strings in the $L-$ordering of the following. If

there are fewer than $6$ string, enumerate the entire language:

a$)L_1$

b$)L_2$

c$)L_1{L}_2$

d$)L_1{L}_2$

Using the languages $L_1$ and $L_2$ from the previous problem, enumerate the

first $6$ strings in the $L-$ordering of the following. If there are fewer than

$6$ string, enumerate the entire language:

a$)L_1-L_2$

b$)L_2-L_1$

c$)L_1{L}_2$

d$)L_2{L}_1$