Consider the following languages over {0, 1}:

L1 = {w : w contains exactly two 1s and |w| 4}

L2 = {w : w doesnt contain the same number of 0s as 1s and |w| = 4}

Give the first 6 strings in the L-ordering of the following:

a) L1

b) L2

c) L1 L2

d) L1 L2

e) L1 L2

f) L2 L1