Answer all the questions 1. Deign the followings i) Design a DFA to recognize the regular language of all strings that contains the substring 1011 ii) Design a DFA, where L(M3)={wl w does not contain the substring 11 or 103 (iii) Design an NFA, where L(N)={wl w ends with 010; iv) Design a DFA, where L(M)={wl w begins with a l and ends with substring 01) v) Design a DFA to recognize the regular language of all strings that ends with the substring 100 [10] 2. (a) Consider the machine N1 0,1 1,8 91 22 43 94 Draw the tree for input 1001101. (6) Give three strings for each of the following languages that are members. i) (OU11 U(E) ii) (18")U(E* 1) iii) ' 1010" iv) (OUE)(1U)1* (c) Convert the regular expression (((abUbb)ba)* aa)* to an NFA. [2+4+4) 3. Consider the machine N2. 0,1 E , 1 41 42 (93 Construct DFA that is equivalent to N2