Question

For a length of string n,how many transactions will be there for acceptance of the string?

1. O(n)
2. O(n^2)
3. O(nlogn)
4. O(n^3)

Comments

I hope you mean number of transitions required to accept a string of length $n$. 

It should be $n$. 

On one transition we read a symbol. So for accepting  length $n$ string we need to go through $n$ transitions. 

---

Thats wat i thought..but answr provided is n^2.