Given a regular expression, (0+1)* 111 (0+1)*, it is a language of: All sting that starts with 111 All string with 111 as a sub string All strings that ends with 111 O All strings with three 1's