Context free grammar:

Let = {a, b}. For the language L defined by each of the following grammars, list the first ten elements of L in lexicographic order (shortest first, then alphabetically if same length), and then indicate whether or not L is regular

(1)

S aS

S Sb

S

(2)

S aSa

S bSb

S a

S b

(3)

S aS

S bS

S

(4)

S aS

S aSbS

S