1. Describe the language of the FSA shown.

2. Write out table of transition function of deterministic finite automata accepting the language

Figure 2: Problem 2 finite automata accepting the language {w{a,b}: each a in w is immediately preceded by one b}