Q:

NFA construction problem

I need to construct an automaton that recognizes the following language of strings over the alphabet $\{a,b\}$:
The set of all strings over alphabet $\{a,b\}$ with the subsequence $abba$. (A subsequence is like a substring, except it doesn't have to be consecutive characters.  For example, $abaaba$ and $babbbba$ are in the language.)   
 

A:

So this worked but i am kind of what is the difference about this one and the one from MRP.