Please provide a detailed solution with a thorough explanation for each of the following questions.

1. What is the regular expression for the language, over alphabet (a, b), of strings that start and end with the substring ab and contain one or more repetition of the substring bab. 2 Describe in English the language associated with the following regular expression: (a+b)*(a+b)*a*(a+ ba+b)* 3. Give a Finite Automaton of the language, over alphabet (a, b), of strings that end with b. 4. Describe in English the language associated with the following Finite Automaton. a,b a b b a 5. Is there anything wrong about the FA below. If so, state what is missing otherwise, justify. a,b b a,b 2,6