Which of the following languages are CF and which ones are not? For each language, if it is CF, give a CFG that generates it; otherwise prove your claim.

20 Points Which of the following languages are CF and which ones are not? For each language, if it is CF, give a CFG that generates it; otherwise prove your claim. La = {w : wuu, u EL((a + b).)) Hint 1: Note that La contains every string of length odd and certain strings of length even. Hint 2: Note that every even length string w in La can be written/viewed as ry, (a). (b), (c). central symbol of y. You can use these hints to design a CFG or a PDA for La L,-{w : w lu, u L(1*01*)} L.-(w : w {a,b,c)', na(w) > nb(w) > ne(w))