Let L be a CFL represented by CFG G over alphabet = {0, 1}. Prove that it is decidable whether or not L contains some string of the language 1*. In other words, prove that L = {(G)|G is a CFG over = {0,1} and 1* n L(G) } is decidable. Note: Remember that CFLs are not closed under intersection and that Etm is not decidable! Let L be a CFL represented by CFG G over alphabet = {0, 1}. Prove that it is decidable whether or not L contains some string of the language 1*. In other words, prove that L = {(G)|G is a CFG over = {0,1} and 1* n L(G) } is decidable. Note: Remember that CFLs are not closed under intersection and that Etm is not decidable