1. Give DFAs that accept the following languages over = {a, b}.

a) L_1 = {x | x contains the substring aba}

b) L_2 = L(a*b* )

c) L_3 = {x | n_a (x) + n_b (x) is even }

d) L_4 = {x | n_a (x) is a multiple of 5 }

e) L_5 = {x | x does not contain the substring abb}

f) L_6 = {x | x has no as in the even positions}

g) L_7 = L(aa*| aba*b*)