aging3 y: Assignment 2-PROGRA! Secure l https://gastateview.usg.edu/d21/le/content/1665335/viewContent/284 uence * Georgia State Online Log in Splunk m LinkedIn InComm Intranet | 3. Use the algorithm described in Section 44.2 of Sebesta to remove direct left recursion from the following grammar: Could the following grammar be parsed using an LL parser? If not, explain why not (be specific!). SLR IR R-L 5. The following questions refer to the grammar shown below. SABC c clco For the sentential form AaaaBc (a) Draw the parse tree (b) List all phrases (c) List all simple phrases (d) What is the handle? 6. Shovr a complete parse including the parse stack contents, anput string and action