Need some help in linguistics

1 FSAs and Regular Languages 1.1 Problem 1 Draw an FSA corresponding to both of the following regular expressions (assume the alphabet is a,b): (1.1.2) (bab?)+ 1.2 Problem 2 Draw an FSA that accepts the complement of ba+! That is, it accepts the complement of the sheep language. (assume the alphabet is a,b, !): For example, it should accept "baa", "ba!", "baaaab!", and any string beginning with "a" or "1", while failing on "baaa