7. (R7) Give a description of the language described by the following regular expression. b*((ab)b*)* 8. (R8) Construct a finite automaton that recognizes the language given below. Assume = {a,b}. Li = {w | w contains at most 2 a's }