. RE->NFA-DFA-> Minimal DFA Consider the following the regular expression a b' (ce | de) a. Write down, by inspection, a DFA to recognize words described by this regular expression Now, show the steps that an automated scanner generator might take with this same regular expression. b. Use Thompson's construction to build an NFA c. Use the subset construction to convert the NFA from question 3.c to a DFA d. Use Hopcroft's DFA minimization algorithm to create a minimal DFA