self doubts

Question

what  is minimum number of states of NFA which accepts language

{abab^n|n>=0} U{aba^n|n>=0}

Comments

Is it 5?

---

i'm also getting 5.

---

but i am getting 4 . i am confused please correct me if i am wrong 

Answer 1

exactly 5 states are required

L={ ab,aba,abaa, abaa,.....,abab,abaa..bbbb}

for accepting ab 3 states

ab after that 1 state for any no of a's

then (aaa..abbb..b) any no of a's should be followed by any no of b's 1 state

total no of states=5