. Consider the following BNF grammar for arithmetic expressions, which incorporates the unary "" operator:

< E > < term > | < term > + < E >

< term > < primary > | < primary > * < term >

< primary > < id > | "(" < E > ")" | < primary >

1- Give the parse tree for each of the following:

x + y * z

( x + y ) * z

x + y + z

x * y * z

x + y * z

( x + y ) * z

2- According to this grammar, are the + and * operators left-associative or right-associative, which?

3- Expand this grammar to incorporate the binary subtraction and division operators "" and "/" with their proper precedence.