See image: consider the following grammar $G$ :

$S$aSb$|aaSb|Sb|lon.$

$($a$)$ Give a description of $L(G)$ using set notation.

L(G)={aibk|?___}

(Hint:trytofindan(in)equalityrelationshipbetweeni and $k$ that is true for all strings in $L(G))$

$($b$)$ Show that $G$ is ambiguous.

$($c$)$ Give an equivalent CFG that is not ambiguous. It suffices to give the rules. Your CFG should not be overly complicated. $($Hint: try to see where the ambiguity comes from: e$.$g$.,$ order of operations, or multiple operations leading to equivalent constructions. Once identified, see if you can come up with new variables to enforce an unambiguous rule set.$)$