Consider the following grammar:

$\}\{1\}|D$

$D1D0|$

$($a$)[3$ marks$]$ Show that this grammar is ambiguous, by giving a string that has two different

parse trees.

$($b$)[2$ marks$]$ Give an equivalent unambiguous grammar, or explain why this is impossible.

$9$

$(5$ marks$)$

Convert the following FSA into an equivalent CFG$,$ using the structure of the automaton. Explain

the process followed for each component of an FSA.