1: Regular Expressions (a) Give two strings that are in the following languages and two that are not in the language. The alphabet is = {0, 1} L1 = 081 L2 = (10)* L3 = '180 (b) Give regular expressions for the following languages over alphabet A = {0,1} 1. All binary strings with exactly two Os (c)Describe the language of the following regular expressions over alphabet S = {0,1} 1. O*(10*10*)* 2. USUS (01 U 10 U11)