1. Let { = {0,1,2}. Write a regular expression to accept all strings over [*, such that third symbol from right is 1 or 2 but not 0 2. Design a RE for the language L = {w | w contain 2 a's at any position and greater than 3 bs at any position, we {a.b}*} 3. Write regular expression for the language L = {a"b", n>=4, m =3 we{a,b}* } 6. Write regular expression for the language L = { w: /w|mod3=0, we{a,b}*} 7. Write regular expression for the language L = {w number of a's in string is multiple of 3 => na(w) mod 3 = 0, we{a,b}*}