Consider the following grammar

$EEE+$

$EE{E}^{**}$

$EId$

$($i$)$ Eliminate Left recursion from the given grammar

$($ii$)$ Left factor the grammar produced in $($i$).$

$($ii$)$ Design predictive parsing table using the resultant grammar

$($Iv$)$ Check whether the grammar produced in $($ii$)$ is ambiguous

$2.$ Draw the parse tree of the following grammar: module :$=$ statement

b$)$ statement ::$=$ PRINT expression$\_$list expression list :$=$ expression $|$ expression COMMA expression$\_$fist expression ::$=$ INT $|$ MINUS expression $|$ expression PLUS expression