Consider the following languages over {0, 1}:

L₃ = {w : contains at most two 1s and |w| = 3}

L₄ = {w : w = w^R, |w| 3}

Using the languages L₃ and L₄ from the previous problem, enumerate the first 7 strings in the L-ordering of the following:

1. L₃L₄
2. L₄L₃
3. L₃³
4. L₄^*