i have this regular expression:

((a|b)*|a*(ba*))

that is supposed to accept all strings of a's and b's that do not contain the subsequence abb.

is my regular expression correct?

and how will the drawing of the finite automata for this expression be?

*if there is something wrong please correct it and give me an explanation.