1. List all the ways to split the string w= baba into three substrings, w=w,W2W; = 2. Let [ = {0,1}, L; = {ww contains substring 11}, L, = {w ||w| is even, and w has 11 as center 2 symbols) a. List the first 5 strings in L, in lexicographical order. (i) List 3 strings in each language below , (ii) describe in English as well as you can b. L* c. LL d. Substring(L) e. Prefix(L2) h(L.) if h:0laa and ilepsilon 3. A language class is a set of languages. This course will cover several language classes (regular, context free, etc), and as a warm-up to this concept, consider the class of finite languages. Assume that I is a finite, nonempty alphabet. Let FINITE be the class of all finite languages over 2, and let COFINITE = {L|Lis FINITE), That is the set-complement of L is a finite language. Use an alphabet of {0,1) or {a,b) or {a,b,c} a. (3) Give an example of a finite language. Given an example of a co-finite language. b. (3) Are there any languages both finite and co-finite? c. (3) Are there any languages NOT in the set FINITE U CO-FINITE? - 4. a. Define Lsmaller than-w Ifw = abbc, under your definition, what is smaller than w? b. For strings r,s,v,w with r