1.5 Each of the following languages is the complement of a simpler language. In each part, construct a DFA for the simpler language, then use it to give the state diagram of a DFA for the language given. In all parts, = {a, b]. a) (w I w contains neither the substrings ab nor ba) b) (w I w is any string not in a'b) c) {w | w is any string not in (ab*)") d) (w I w is any string not in a Ub) e) (w I w is any string except a and b) 1.6 Give state diagrams of DFAs recognizing the following languages. In all parts, = {0, 1]. a) (w I w begins with a 1 and ends with a 0) b) (w I w contains at least three 1s) c) (w I w contains the substring 0101) d) (w I w has length at least 3 and its third symbol is a 0)