onsider the following grammar:

$SAB$

$AAx||$

$ByB|y|$

a$)$ Show the terminals and non$-$terminals of this grammar?

$[2$ Marks$]$

b$)$ Construct a parse tree for the string $"y"$

$[3$ Marks$]$

c$)$ Illustrate if the language of this grammar could be captured by a regular expression with justification.

$[5$ Marks$]$