QUESTION 1A. Consider this FA. a. List all possible four-character words found in the language defined by this FA. b. True/False. If, a b } then this FA accepts all words in the set . (with the exception of A). Provide a persuasive proof of your answer. c. Convert this FA to an RE using the state elimination algorithm. QUESTION 1B. Consider an automaton that will read exactly three characters from the alphabet 013. The automaton will finish in one of eight states (labeled 0+ to 7+) by landing on the state that corresponds to the three-bit binary number that has been read. For example, 000 will finish at state 0+; 001 will finish at state 1+; 010 will finish at state 2+; etc. a. Draw the simplest possible TG for this automaton. b. Draw an NFA for this automaton