Consider the alphabet set Σ = {a b}; Write Regular Expressions for the following definitions. 1. Language of All those words which do not contains double a’s. 2. Language of All those words which do...

Consider the alphabet set Σ = {a b}; Write Regular Expressions for the following
definitions.
1. Language of All those words which do not contains double a’s.
2. Language of All those words which do not contains double letters.
3. Language of All those words which has at most three letters.
4. Language of All those words which do not contains substring ab.
5. Language of All those words in which total number of a’s are divisible by 5
6. Language of All those words which do not contains substring baa.
7. Language of All those words whose length is odd and they contain ab.
8. Language of All those words which ends with bb and have odd length.
9. Language of All those words which do not end with ba.
10. Language of All those words which contains ODD a’s and ODD b’s