If L is a language, L* denotes the language whose words are concatenations of 0 or more words from L. 1) Given L = {ab,aa,baa} which of the following strings are words in L*? abaabaaabaa aaaabaaaa baaaaabaaaab 2) Find a grammar for the language L = {an, where n is even and n>3} 3) Give a simple description of the language generated by the following grammar: S aaA A bS S 4) Give DFAs for each of the following languages: {ab4wb : w {a,b}*} {ban : n >= 1, n !=4} 5) With = {a,b} give a DFA for L = { w1aw2 : |w1|>=3, |w2|<=4} (It will frequently be easier to do a handwritten solution than to try to type it. So you can scan your solution into a pdf and drop that in the drop box.)