Using the algorithm covered in class, construct a NFSA with e moves equivalent to the regular expression (a+b)(ba*+(ba)*)*. Do not simplify any intermediate steps and the resulting diagram.

3, Using the algorithm covered in class, construct a NFSA with -moves equivalent to the regular expression (a+b)(ba*+(ba)*)*. Do not simplify any intermediate steps and the resulting diagram