2. Give regular expressions over = {a,b) that generate the following languages. a) Lx | x contains 3 consecutive a's) b) L2 = {x | x has even length) d) L4 = {x | x contains the substring aaba) f) L.-{x | x doesn't end in aa)