I need a detailed explanation of this problem as if you were trying to teach the concept. Please don't use the other answers on this problem, as they are incorrect

5. Consider the following grammar. 012345678SS$S(XSEsq)SF(XE)XFsq)EAFAA (a) Carefully build the start state (and only the start state) of the LR(1) parsing automoton. (b) Given only the start state of the parsing automaton, fill in as much information as you can for the corresponding row in the action and goto table. (c) What can you conclude about the grammar knowing only the start state? 5. Consider the following grammar. 012345678SS$S(XSEsq)SF(XE)XFsq)EAFAA (a) Carefully build the start state (and only the start state) of the LR(1) parsing automoton. (b) Given only the start state of the parsing automaton, fill in as much information as you can for the corresponding row in the action and goto table. (c) What can you conclude about the grammar knowing only the start state