Assume the alphabet = {a,b) .

Give the set all strings over of length less than or equal to 2 including the null string.

For each of the following languages, which of the above strings are in the language defined by the following regular expressions. (Show your work clearly).

(i) a*b*

(ii) a(ba)*b

(iii) a* + b*

(iv) (aaa)*

(v) (a+b)*a(a+b)*b(a+b)*a(a+b)*

(vi) aba + bab

(vii) ( + a)b

(viii) (a + ba + bb)(a+b)*