[5] a) Construct DFA for the following languages given, 2 = {0,1}. i) Where L(M2)={w w contains at least three l's} ii) Where L(M3)={wi w does not contain the substring 1110} [2+3] b) i) Construct an NFA that recognizes all strings over {0,1} containing a 0 in the third and 1 in the second position from the end. ii) Let N, be the following NFA 1,8 92 Q3 Given that, E = {0, 1}. Show that the class of regular languages is closed under the star operation for the above NFA