ISRO CS-2023

Consider the NFA with epsilon-transitions below, which is meant to accept strings corresponding to a lexical token id. Here the token digit corresponds to the extended regular expression [0-9]and letter to [a-z A-Zl. In the diagram, a small incoming edge indicates a start state while a double circle indicates a final state. Which of the following extended regular expressions corresponds to the token id?