Please provide the correct answers for both!

$1.$ Using the grammar of the example, show the stack as it changes, while top$-$down parsing the input $"$x$-$y$*$z$"$ until either an error or success $($explain which and why$)$

$$ Show the stack one change at a time

E $->$ E $+$ T $|$ E $$ T $|$ T

T $->$ F $*$ T $|$ T $/$ F $|$ F

F $->($ E $)|$ id

$2.$ Remove left recursions only from:

$$ S $->$ Sa $|$ abS $|$ SBa $|$ bSa

$$ A $->$ aa $|$ bA

$$ B $->$ bBa $|$ b