Convert step by step the following regular expression to an NFA (non-deterministic finite automaton):

((a|b)*abb)

Use Finite State Machine Designer (http://madebyevan.com/fsm/) to show all the stages of the conversion (i.e., create multiple FSMs of all components that you construct as you progress through the construction).