Consider the following languages over $\{0,1\}$ :

$L_1=\{w$:$w$ begins and ends with the same symbols, $|w|3\}$

$L_2=\{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$)L_1$

b$)L_2$

c$)L_1^3$

d$)L_2^{*}$