Finite automata accepting the language {w ∈ {a, b}* : each 'a' in w is immediately preceded by one 'b'}.
a) Deterministic finite automaton.
b) Non-deterministic finite automaton.
c) Turing machine.
d) Pushdown automaton.