Question 1 - Finite Automata, Regular Languages and Regular Language Properties (30 points) (a) s poluts Draw a FA for the language of the RE * +(ab) (6) 5 points Draw a FA for the set of the strings with alphabet (c.b,c} that have a substring of length 3 containing each of the symbole (e) [10 points Using the subect construction algorithm convert the following NFA into an equivalent DFA Clearly indicate the DPA and its transition table. In addition, convert the NFA into its equivalent RE. 01 () [10 points Using the table-Gilling algorithmn, construct the minimum state DEA for the following DEA. For each distinguishable pale, state the string that differentiates the palestates