minimised DFA

Question

Answer 1

$1$ state is required as above NFA accepts $(0+1)^*$

Answer 2

1 state is required. As it is clear from the NFA that it is accepting every possible string over 0,1.

Answer 3

I think it requires two states because DFA for this will be 1(0+1)*

Comments

I got 4 states.......whats the ans..???

---

no ,,it can directly go to final state with a single epsilon ..