Find dfa's for the following languages on = {a, b}.

a) L = {w : |w| mod 5 = 0}

b) L = {w : n_a (w) mod 3 < n_b (w) mod 3}

c) L = {w : (n_a (w) + 2n_b (w)) mod 3 < 1}

d) L = {w: |w| mod 3 = 0, |w| 5} means not equal