1. Give regular expressions for the following languages a) Binary strings ending in 01. (0 1*01 b) Decimal integers divisible by 5 D*(05) c) Binary strings consisting of an odd number of 1s. (0* 0*1010 d) Binary strings containing the string 010 0O1)* e) binary strings that do not contain the string 010 Given the alphabet I-{a, b}. Give the regular expressions for the following languages a) (0*1010*10*) 2. all strings with no more that three a's b) all strings with the number of a's divisible by three c) all strings with exactly one occurrence of the substring aaa Which of the following are true? Explain. a) baa e a* b* a* b* b) (b*a*) n (a* b*)-a* b* c) (a* b*)n (b* a*) D d) abcd e (a (cd)* b What is the language represented by each of the following regular expressions? a) (a* a) b)|b 3. 4. c) 0 *0 5. Which of the following strings belong to the language described by the regular expression Q*I(0*10*10*10*)*? ?) 1001101 b) 000 c) 110101 d) 10001000 e) 011001000111 f 1001001 g) 111 h) 11101101 i) 11000101