1. Draw a state-transition diagram for an FSM that recognizes strings denoted by the regular expression A*BB*C
2. Draw the state-transition diagram for a deterministic FSM that recognizes the strings AI(AB). Take care not to accept any other strings, such as ABB.