Give an example of a context$-$free grammar over the alphabet $\{$a$,$b$,$c$\}$ that is $(1)$LL$,$ but is Not $(1)$ LALR. in your answer, A$.$ Introduce the grammar. B$.$ Calculate the functions First and Follow for each of the variables of the grammar. third. Build the punctuation table of a prediction breaker for grammar. Show that there is no punctuation in the table This is collisions. d$.$ Construct the item automaton $(1)$LR of the extended grammar. God. Build the punctuation table of a canonical LR breaker $(1)($Action part and Goto part$).$ showed There are no conflicts in this punctuation table. and. Explain well why the grammar is not $(1)$L