1. Suppose I give a test question to design DFSA to all of you. a. If all answers are the same, what can I conclude if anything about the answers. b. If all answers are different, what can I conclude if anything about the answers. c. Now suppose, in #2, I minimize all the answers and they all turn out to be the same, what can I conclude if anything about the answers. 2. Design a DFSA to extract valid identifiers. An input source contains only identifiers separated by spaces. Identifiers must start with the letter 'i', then '_' and then digits only. Since it wasnt specified, you may require at least 0 digits or at least one digit which is the intended option. Example input i_22 i_2 i_232 The DFSA would recognize one token at a time or generate error otherwise (as on input 'i123'). a. Give input alphabet b. Show the DFSA as a labeled directed graph with one starting state and one or more final states.