PLEASE BE DESCRIPTIVE.
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 a's precede the b's and c's.
2) The set of strings over {a, b, c} that contain odd number of a's
3. Construct DFA without e-transition that accepts the following language:
1) (ab+a)+
2) (ab)*(ba)*
4. Give a DFA without e-transition that accepts the set of strings over {a, b} that contain at least one b if its length is at least four.