pls answer both

Question 3 (1 point) All string that starts and ends with a different symbol: b(a+b)* a O a (a+b)* b b (a+b)* b a (a+b)* b + b (a+b)* b Question 4 (1 point) Given a regular expression, (0+1)* 111 (0+1)*, it is a language of: All strings that ends with 111 All string with 111 as a sub string All strings with three 1's All sting that starts with 111