automata theory

4. a) Consider the following languages over {0, 1}:

L1 = {w : w contains more 1s than 0s and |w| 3}

L2 = {w : w has an even number of 0s 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) L1

b) L2

c) L1 L2

d) L1 L2

b) Using the languages L1 and L2 from the above, enumerate the first 6 strings in the L-ordering of the following. If there are fewer than 6 string, enumerate the entire language:

a) L1 L2

b) L2 L1

c) L1L2

d) L2L1