Convert NFA to DFA

Question

I have to convert the following NFA's into the equivalent DFA's.

I have done the following:

Could you tell me if it is correct??

Answer 1

Your first conversion is correct.

You need to label your initial node in your second automaton. You also need to consider the epsilon-closure when creating new states - e.g. {1,3} should not be a node, as it is possible to reach state 2, from state 1, under an epsilon-transition.

Answer 2

The first is ok, the second is more like :