May I have some help with these problems, I am having a difficult time understanding it.

L1={w:w contains more 1's than 0 's and w3} L2={w:w has an even number of 0 's and w3} 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 E 2 d) L1 C 2L2 Using the languages L1 and L2 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) L1L2 b) L2L1 c) L1L2 d) L2L1