Q1: Write down regular expressions for each of the following languages. Assume = {0,1] [6 marks] The language contains strings where Os and Is always appear in pairs. For example-001100, 1100110011001100 etc. The language contains strings which start and end with different characters. The language contains strings in which the number of Is between every pair of consecutive Os is even. The language contains strings having equal no, of "01" and "10" substrings The language contains strings whose parity of 0 and 1 are different. The language contains strings where every 0 is followed by at least three I's. Q2: Draw a DFA for the language L, n L [4 marks] Let = {0,1). Consider the following pair of languages over E. L= {w: the length of wis divisible by three} L = { : every second letter in w is a 0} Q3: [5 marks] Convert the DFA of Q2 to RegEx using State Elimination Method, Q4: [3 marks] Write down a regular expression that generates the following language. L=(w (0,1,2)*: the last letter of u appears at least twice in w} Q4: [3 marks] Write down a regular expression that generates the following language. L = {w (0,1,2)*: w contains at least one I and one 0} Also draw a DFA for the language. Q5: [4 marks] Write down a regular expression that generates the following language. L = {w (0,1) : exactly one occurrence of 00 appears in w}