Let S $=\{$a$,$ b$\}.$ For the language that are defined by each of the following grammars

i$)$ L$($G$1)$ : S $$ aS $|$ Sb $|$ e

ii$)$ L$($G$2)$ : S $$ aS $|$ bS $|$ e

Do each of the following:

a$)$ List TWO strings that are in L$($G$1)$ and L$($G$2).$

b$)$ List TWO strings that are not in L$($G$1)$ and L$($G$2).$

c$)$ Describe L$($G$1)$ and L$($G$2)$ concisely. You can use regular expressions or set theoretic

expressions.