only question 4 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 3. In each case below, show that the grammar is ambiguous, and find an equivalent unambiguous grammar (a) S SS Cab a (b) S ABA, A a AIE, B bBIE 4. Design a PDA to accept each of the following languages. You may design your PDA to accept either by final state or empty stack, whichever is more convenient. (b) (anb n 20) u tab" n 20) u n 20) 5. Give an example of a PDA P (Q, Y,I', o, go, Zo, F) is a PDA, and strings T. y E Y, a,F+ Y e U I)* such that (q, ar, ar) H(p, y, BY) but (q, ar, a) H (p, y, B) does not hold. ENG 3:32 PM Ask me anything US 2017-03-2