answer all three questions and show steps $.$

Using the CFG shown below answer all three questions:

A $->$ AX $|$ AN $|$ B $|$ D

X $->$ a$|$b

N $->$ c$|$d

B $->1|2$

D $->3|4$

question$1)$

After removing left recursion, consider the input sentence $3$ab$,$

question$2)$ How many backtrackings are there in generate

the input sentence using left most derivation before you stop.

question$3)$

Consider the non recursive grammar. How many backtrackings are there in generating the input sentence $13$a using

left most derivation? Must show the derivations. If you cannot continue, show steps and the number of

backtrackings before stopping.

answer all three questions and show steps $.$