Consider the following languages over {0, 1}:

L1 = {w : w begins and ends with the same symbols, |w| 3} L2 = {w : w = w^R, |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^3 d) L2^*