I need the answers with a clear explanation please.

3. = 10.1)(11,000)U(10)" aab +(bb+aaba)" 4. Let ={a,b). Let L be the language consisting of all strings of length at least 2 over whose a) Let = {0,1). Find a regular expression corresponding to the language b) Let 2 t = {a,b). Give the language corresponding to the regular expression (a,b). Give the language corresponding to the regular e rst and last characters are the different. Give a regular expression corresponding to L