Given G$,$ a phrase$-$structure grammar.

Let G $=($V$,$ T$,$ S$,$ P$),$ where

V $=\{$a$,$ b$,$ A$,$ B$,$ S$\},$ T $=\{$a$,$ b$\},$ S is the start symbol,

P $=\{$S $->$ aAbBa, A $->$ bB$,$ Ab $->$ aA$,$ B $->$ ab$,$ AB $->$ b$\}.$

What is the language generated by G$,$ L$($G$),$ that is the set of all strings of

terminals that are derivable from the starting state S$.$