1. Come up with regular expressions (briefly include your logic) for the following Regular languages. Come up with 3 valid and 3 invalid strings for each of the regular expression. Strings over the alphabet (0,1), where every o is followed by at least a 1' Strings over the alphabet - fa,b), which starts and ends with same symbol 2. For each of the following languages, give two strings that are members and two strings that are not members. Assume the alphabet fa,b. b) (atbatbb)(a+b) c) a(ba) b d) a b* 3. Using any of the algorithms discussed in class (or in the book), convert each of the following languages to a finite automaton. Consider alphabet- (0,1). Include the steps that you follow. Also come up with three valid and invalid strings for each of the automata a) The set of all the strings that always end with 00. b) 1 (00+ 001)* 4. Convert each of the following finite automata to their corresponding regular expressions, Include the steps that you follow.Also come up with three valid and invalid strings for each of the automata Alphabet is (a,b). a,b