PROGRAMMING GRAMMAR/PARSE TREES

5. [20] Using the following grammar: Expr Terrn + Expr l Terrn * Expr l Term Term 01112131415161718191(Expr) draw a parse tree for each of the following and compute the final answer for each expression according to the precedence rules imposed by the grammar: (c) 5+6 2 (d) "6+2