Part 1: Regular expressions 1. Find a possible alphabet for the following languages. a. The language L = {1110, 123, 01) b. The language L = {apple, pear, 4711 C. The language of all binary strings 2. Which one of the following languages over the alphabet (0,1) is described by the regular expression ( 0 1 )*010 | 1)*010 | 1)* The set of all strings containing the substring 00. (B) The set of all strings containing at most two O's. The set of all strings containing at least two o's. (D) The set of all strings that begin and end with either 0 or 1. (A) 3. Find the string with length two that is not in the language over alphabet (a,b) represented by the regular expression a*(ab)*b* 4. Suppose the only characters are 0 and 1 in the language Write a regular expression for strings containing 00 as a substring Write a regular expression for strings that contain at most one zero 5. Suppose our alphabet is a,@, and ., where a represents "some letter". Write a regular expression for email addresses Note: emails come in different forms such as cs143@cs.stanford.edu first.middle.last@mail.site.org barack obama@whitehouse.gov Only consider the following forms in your RE design