Give the first $3$ strings in the L$-$ordering

in each of

the following languages over $=\{0,1\}$ below. If the language has no enough number of strings, then list all its

strings. Let $L_1=\{,1,10,001\},L_2=\{0,001,011\},$ and $.$

a$),L_1-L_2$

b$),L_2{L}_1$

c$),L_1^2$

d$)$

Convert the following regular expression to a NFA or DFA.

$(0+1+)(0+1+)(0+1+)+0**10**{10}^{**}$