The languages over the alphabet {a,b,c} are

L₁ = { w | w begins with the letter a and ends with substring ac}

L₂ = { w | w contains at least two as and w contains no more than one c}

L₃ = { w | the length of w is at most 3 and w is a palindrome that is, w=w^R }

a. For each language, list (i) shortest string in the language, and (ii) two other strings in the language.

b. For each language, describe (in English) the language L_i^R = { set of strings that are the reverse of a string in L_i }

c. For each language, describe the concatenation L_iL_i = { xy : x and y are strings in L_i }

d. For each language, describe L_i*