$1-$ nsider the following Grammar:

$$ Letter $>$

$||$ Digit $>$

$||$ Letter $>$

$$ Letter $>A|B|dots.|Z|a|b|dots.|z|$

$$ Digit $>0|1|dotsdots.|9|$

Find

a$.$ What are terminals and non$-$terminals.

b$.$ Convert from BNF to Extended BNF$.$

c$.$ Draw the Parse tree for left most derivation for the given inpu Ab$1$x$..$