1. Build transition diagrams for deterministic finite automata that accept the following languages. For each DFA, include the state diagram and the transition table. (a) {w {a,b}* : w ends with aba}. (b) {W {a,b)* : w has length 3 and its third symbol is b}. (c) Sipser 1.4e (intersection); note that this solution will yield three DFA (d) Sipser 1.5g (complement); note that this solution will yield two DFA (e) (bonus) {w {0,1}" : w begins with 1 and, when interpreted as a binary number, is a multiple of 5} (note: since this DFA uses alphabet {0,1), please flip our conventions and use states a, b, c, ...) 1. Build transition diagrams for deterministic finite automata that accept the following languages. For each DFA, include the state diagram and the transition table. (a) {w {a,b}* : w ends with aba}. (b) {W {a,b)* : w has length 3 and its third symbol is b}. (c) Sipser 1.4e (intersection); note that this solution will yield three DFA (d) Sipser 1.5g (complement); note that this solution will yield two DFA (e) (bonus) {w {0,1}" : w begins with 1 and, when interpreted as a binary number, is a multiple of 5} (note: since this DFA uses alphabet {0,1), please flip our conventions and use states a, b, c, ...)