1. Consider the following languages over {0,1} : L1={w:w begins and ends with the same symbols, w3} L2={w:w=wR,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) L13 d) L2 2. 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 7 string, enumerate the entire language: a) Suff(L2) b) Pref(L1) c) h(L1) where h(0)=ab and h(1)=c,={a,b,c}