both questions 7 and 8 please!

W Fo C Secure h ps://us encs concordia ca ne/comp335/assgn3.pdf ers Apps R Facebook D operating system Cor r COMP 335 Introd D Introduction To Auto G internship computers Programming problen P Perfect Resume Builde D sec71.70pdf A Dr. Aiman Hanna De assgn3-pdf (b) S 0A0 1B1 BB, A C, B AS A, C S E 7. Use the Pumping Lemma for CFL's to show that the following languages are not Context-Free. (a) tw E ta, b, c) na w) nb (u) and na (w) c(w) (b) tan bice d' n s k and j s l) 8. Using the methods in the text, (a) convert the grammar G (IS, At, 10, 11, HS OS A, A 1A0ISIE S)) to a PDA that accepts exactly L(G) (b) convert the PDA P ({go, q1 ta, b, HA, Zo ,o, qo, Zo, Where 90, a, to a CFG G, such that L (G) L(P) ENG 3:33 PM O Ask me anything 2017-03-2