You may use the following two theorems for any of the proofs required in the following problems: Theorem: E DFA = {| A is a DFA and L(A)=} is decidable.

Theorem: A CFG ={|G is a CFG that generates the string w} is decidable.

Show that A CFG ={ | G is a CFG that generates } is decidable.