1. Give a regular expression for binary strings that do not contain 11 as a substring. 2. Give a regular expression for binary strings whose number of 0 s is divisible by 3 . 3. Give a brief description of the language matched by the regular expression (01)111(0+1)