Let $C = \{ \langle G, x \rangle \mid \text{G is a CFG$x$is a substring of some$y \in L(G)$}\}$. Show that $C$ is decidable. (Hint: An elegant solution to this problem uses the decider for $E_{CFG}$.)