Answer the questions based on the given CFG: S $->$ aaBB $|$ aCB B $->$ b $|$ C $->$ AB A $->$ a $|$ a$)$ With the help of Parse Tree show that the CFG is ambiguous for the string $$aabb$.$ b$)$ Modify the CFG to remove the ambiguity for the said string