theory of computation

Question

The DFA for the complement of the language accepted by the above NFA is   

which is the answer ??? A) or B) ??? I feel B) is not a DFA and so A) is the answer ... please correct me if am wrong ...

Comments

A is right

In dfa every state have transition 

B isNfa. Not dfa

---

it should be A as it should have a dead state too!

---

Hi Vignesh, by the defination of DFA "Every State must have transition on every input alphabet". Here alphabet contains {a}. So a state should have transition on "a". A is the correct answer.

Answer 1

" The DFA for the complement of the language accepted by the above NFA is   "

here the language accepted by e-NFA is  a⁺ 

so the complement of the language is only epsilon

so A is the answer