Bookmark PLEASE BE DESCRIPTIVE. THANKS!

1. Using proper English, describe the following regular language:

1) (ab)* aa

2) b*a*

2. Give a regular expression that represents the described set:

1) The set of strings over {a, b, c} in which all the as precede the bs and cs.

2) The set of strings over {a, b, c} that contain odd number of as

3. Construct DFA without -transition that accepts the following language:

1) (ab+a)+ 2) (ab)*(ba)*

4. Give a DFA without -transition that accepts the set of strings over {a, b} that contain at least one b if its length is at least four.