Discrete event systems

Problem 6. Given the event set fa,b.g, construct a FSM that marks a) The language (abg, abb, bbg b) The language denoted by the regular expression (ab)'g c) The language denoted by regular expression a(ba)'a Problem 7. Find a regular expression for the language marked by FSM as: 0 2 a. 3 a