Thanks

032601/101/3/2018 Question 4 Give a possible reqular expression that generates the language L consisting of all words in which all words . either contain no a's at all, or . when there are a's, they occur in clumps of three or more a's, and when there are a's, there are an even number of such clumps of a's. For instance, words such as b, bbbbbaaaabaaaaabbba and aaabbbaaaaaabaa language, and words such as aaaa and aaabaa are not words in the language. abaaab are words in this