Regular expression to NFA [A-E]|[A-E] [A-E] [A-E]|[A-E][A-E][A-E] [A-E]

Question

I have this regular expression

[A-E]|[A-E]{3}|[A-E]{4} 

[A-E]|[A-E] [A-E] [A-E]|[A-E][A-E][A-E] [A-E]

it recognizes strings of A,B, ABC, BCD, BCDE, etc.

I want to construct the NFA but have no idea if i am correct

1. I have done this

2. or this

Which one is correct ?

my [A-E] NFA is

Answer 1

The minimal DFA is the following

0 -> 1 -> 2 -> 3 -> 4

with every transition arch signed by [A-E] and with final states = {1,3,4}

In fact this DFA is equivalent with both your NFA. Nevertheless I find the second to be clearer.