for each of the following languages over the alphabet {a,b}, construct a finite automaton accepting it. Also write a one paragraph explanation of how each automaton works.

a) All strings, where every occurrence of an a is followed immediately by a b.

b) All strings that contain bbb as a substring at least once.