Construct DFAs for each of the following regular languages. In all cases the alphabet is {a, b}. a) The set of strings that has exactly 3 bs (and any number of as). b) The set of strings where the...

Construct DFAs for each of the following regular languages. In all

cases the alphabet is {a, b}.

a) The set of strings that has exactly 3 bs (and any number of as).

b) The set of strings where the number of bs is a multiple of 3 (and there can be

any number of as).

c) The set of strings where the difference between the number of as and the number

of bs is a multiple of 3.