Let G = (V, , R, S) where V = {a, b, S}, = {a, b}, and R contains:

S aSb

S aSa

S bSa

S bSb

S epsilon

Show L(G) is regular.

Note: The grammar G is not regular. Hence you must figure out what L(G) is and then provide evidence (DFSM, NSFSM, or regular expression) to show that language is regular