Answer all the questions. Give regular expressions for each

2. Design a RE for the language L = {w | w contain 2 a's at any position and greater than 3 b's 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}*}