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

(a) Give any string/sentence of length seven in the language generated by the grammar. (b) Compute nullable, FIRST and FOLLOW for each non-terminal. (c) Is the grammar LL(1)? yes / no Explain. (d) Define what left factoring means. (e) Is it possible to left factor the grammar? yes / no If so, give the result. If not, explain. 11a1b23456SIXX:LXSIIidILlbLidL(lb:L) (f) Is the result LL(1)? yes / no Explain