Problem 1: a) Find all strings in L((a + b)*b(a + ab)*) of length less than four. b) Provide 2 strings that are from and 2 strings that are not from the language of the regular expression R = a(ba)*b(aa+b) c) Provide 2 strings that are from and 2 strings that are not from the language of the regular expression R = ( (a+b)a(b+) d) Find a regular expression for the language L-{ab"w:n 3, w {a,b} + } e) Find a regular expression for the language L={w | there are exactly 2 a's in w} f) Find a regular expression for the language L={ww contains at most 1 b and at least 2 a's}