Please solve all 3 parts as per requirements

this needs to be solved on a paper and not on a computer! Thanks!

S.No. Assignment Q1 a) Find the ambiguity and remove the left recursion: S + A+SA A - A*BB B - a b c b) Perform the left factoring of the following: E EtSesiEtifEtSes| iEtSiElab Let G be a formal grammar with non-terminal symbols A, D, B and c) C', terminal symbol 'x','t' and 'S', start symbol 'S', and the following production rules: AB$ B-DC C' +DC' Dx Construct an LL (1) parse table for the grammar. Calculate FIRST & FOLLOW sets as needed. Use the parse table to recognize the sentence x+x. Show the stack implementation