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').

Give input alphabet

Show the DFSA as a labeled directed graph with one starting state and one or more final states.