Please Please provide complete answer with the complete diagram draw on a paper. I am providing example diagram. This is how it must look like. NO DIGITAL DIAGRAMS ARE ACCEPTED!$>$ i'll downvote if weird diagram

Example: DFA

Simplified DFA

Design a DFSA to extract valid identifiers. An input source contains only identifiers separated by spaces. Identifiers must start with $\text{'}$i$\_\text{'}$ and then any number of digits. Example input

i$\_$ i$\_1$ i$\_23$

The DFSA would recognize one token at a time or generate error otherwise

$1.$ Give input alphabet

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