a) (8) Draw a parse tree of the program best (1, 2, 3) using the following grammar where comma, id, number, lpar and rpar are tokens. Tokens lpar, rpar and comma refer to characters '(',')', and ,' respectively. -> id lpar rpar -> number -> comma number -> E b) (7) Draw a decorated parse tree of the program best (1, 2, 3) using the following attribute grammar where comma, id, number, lpar and rpar are tokens as in part a). id.value is the string value of the id token. -> id lpar rpar .name := id.value .x := .x -> number .x := .x + 1 -> comma number 1.x := 2.x + 1 -> E .x := 0