Question 1 - Finite Automata, Regular Languages and Regular Language Properties (30 points] (a) (5 points) Draw a FA for the language of the RE 4* +(ab) (b) (5 points) Draw a FA for the set of the strings with alphabet {a,b,c} that have a substring of length 3 containing each of the symbols. (c) [10 points Using the subset construction algorithm convert the following NFA into an equivalent DFA Clearly indicate the DFA and its transition table. In addition, convert the NFA into its equivalent RE. 0,1 (d) [10 points Using the table-filling algorithm, construct the minimum- state DFA for the following DFA. For each distinguishable pair, state the string that differentiates the pair states. 0,1