a) Construct DFA for the following languages given, = {0, 1}. i) Where L(M2)={w|w contains at least two 0's} (ii) Which accepts the regular language of all strings that ends with the substring 1001.