Let $A = L(G_{1})$ where $G_{1}$ is defined in Question $2.55$. Show that $A$ is not a DCFL.(Hint: Assume that $A$ is a DCFL and consider its DPDA $P$. Modify $P$ so that its input alphabet is $\{a, b, c\}$. When it first enters an accept state, it pretends that $c’s$ are $b’s$ in the input from that point on. What language would the modified $P$ accept?)