1: Regular Expressions (a) Give two strings that are in the following languages and two that are not in the language. The alphabet is E = {0,1} L1 = 02*1 L2 = (10)* L3 = 2*12*0 (b) Give regular expressions for the following languages over alphabet ? = {0,1} 1. All binary strings with exactly two Os (c)Describe the language of the following regular expressions over alphabet E= {0,1} 1. 0*(10*10*)* 2. EU EU &*(01 U 10 U11)