compiler

Question 4 (1 point) Given a regular expression(0+1)* 111 (0+1)", it is a language of: All string with 111 as a sub string All strings that ends with 111 All sting that starts with 111 All strings with three 1's Question 5 (1 point) This FA accepts the following regular expression aaa aaa + aaaaaa aaa (aaa) None of the above Question 6 (1 point) ab . . a. This FA accepts the following language: All strings that has string length 2 All strings that has string length > 3 All strings that has string length 1 All strings that has string length 3