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 L1 = {&, 1, 10, 001}, L2= {0, 001, 011}, and L= {}. a) D c) L1-L2 LL1 L L L2 5. Convert the following regular expression to a NFA or DFA. (0+1+ ) (0+1+ ) (0+1+ ) + 0*10*10*