Consider the alphabet {a-z, A-Z, 0-9, -, E} and the following regular defi SNUM → (-+)? [0-9]²(E [0-9]+)? note the first is the sign character SID → [A-Z] [a-z]* LOGIC | # | < | <=| > | >= 1- Draw the Finite Automaton for each of the two regular definition.