Let $G$ be the CF grammar that has the production rules: $S \to aS | aSbS | c$. Show that $G$ is ambiguous.
I thought of proving it by representing the string $aacbc$ but I don't know if it is correct as a solution:
$aS \to aaSbS \to aacbS \to aacbc$
$aSbS \to aaSbS \to aacbS \to aacbc$
