1. Preliminaries Attempt the Chapter 0 Exercises in the class text book Introduction to the Theory of Computation by Michael Sipser, third edition (Pages 25-27). = 2. Operations on languages (a) Give examples of strings in the language (L1L2)+L3L4* L5 where Li {he, she, my TA}, L2 = {said, told, whispered}, L3 = {that CSE 309 is}, L4 = {so}, and L5 = {much fun}. (b) Give examples of strings in the language Li\(E*{n}S*) where L1 {I, do not, like, 309}. Here = {1,a,b,...,2,3,0,9}. 3. The empty string (a) Let L = {} = 0 by the empty language. Compute L*. (b) Give a language L for which L+ + L*\{1}. (c) Characterize all languages L for which L*\L+ = 0. 4. Langauge concatentation (a) Let L = {1, a}. Characterize L20. (b) Let L = 5* . {aa, bb} *. Characterize L. (c) Compute LL3 and L2L3 where L1 = {}, L2 = {1}, and L3 = {b}. 5. Which language? Let PREFIX(L) = {u|u is a prefix of w where we L} be the set of all prefixes of strings in L. (a) Let L = 5* . {a}. Characterize PREFIX(L). (b) Let L = {a"b" | n >0}. Characterize PREFIX(L). (c) Let L = {a"b" | 0