5. (15 pt) Design an equivalent NFA for each of the following regular expressions:

(a) ((a+ba)b + aa)*

(b) (a + ba)b + aa)

6. (20 pt) Show that the following languages are not regular.

(a) L = {a i b j | i = 2j}.

(b) L = {w {a, b, c} | w is a palindrome (i.e. w = w R)}.

5. (15 pt) Design an equivalent NFA for each of the following regular expressions: (a) (babb* + a)* (b) (a + bab+aa)* 6. (20 pt) Show that the following languages are not regular. (a) L = {a'w li= 2;}. (b) L = {w {a,b,c}* | w is a palindrome (i.e. w = w = WR)}