6. Given a context-free grammar G with productions as follows: (5*5=25 marks) S(L) | aS | a LL,S|S (1) Construct G' by eliminating the left-recursion and extracting the left-factor in G; (2) Give a left-most derivation with G' for sentence: (a, a), and build the corresponding parsing tree; (3) Construct First and Follow sets for all non-terminal symbols in G'; (4) Construct LL(1) table for G', and tell whether G' is an LL(1) language; (5) Provide a complete LL(1) analysis for sentence: (a, a), with your LL(1) table.