Using the methods presented in figures $1\mathrm{.}46,1\mathrm{.}48,$ and $1\mathrm{.}50$ in the textbook, construct an NFA

that recognizes the language of the following regular expression

$(ab{)}^{**}ba$

Present the intermediate automata you obtained while creating your final answer.