Question 1: Writte fegular Expression for following Languages, \{20 marks] 1. L={x over {a,b}x starts and ends on different alphabet } 2. L={x over {0,1}x contains 01 but does not contain the 010 as a substring } Question 2: Deslign DFA tor the following Lancuages. [20 marks] 1. L={x over {0,1)3d last element must be 1] 2. L={x ower (0,1)x as a binary number divisibie by 3} 3. L={x over {0,1)x contains 01 but does not contain the 010 as a substring\} Question 3: Write RE for the following Languge then convert it to DFA uiling lollowing Steps. [20 markis] 1. ME to Ni A-null conversion 2. NFArmill to NFA converuon 3. NFA to DFA comversign Lndwe I wrover En\{ab\},w contains ab but does net end with aba\} Question 4: Use state eliminatlon method to write RE frem a given DFA. (20 marks) TgA Assignment 1 Due Date: 6 arth 2003 Question 5: Draw the computation tree for the following string "abb" for both NFA and NFA-Null. [20 marks]