Consider the following grammar for "lisp" expressions:

lisp : num SEMI num: NUMBER num: LPAREN PLUS num num RPAREN num: LPAREN MINUS num num RPAREN num: LPAREN TIMES num num RPAREN num: LPAREN DIV num num RPAREN num: LPAREN CAR list RPAREN list: LPAREN seq RPAREN list: LPAREN CDR list RPAREN seq: num seq: seq num 

This grammar derives valid LISP expressions from the start non-terminal lisp. You may assume NUMBER token matches any number. Other tokens are self-explanatory and CAR and CDR are keywords. Some valid LISP expressions are shown below:

34; (+ 20 30); (* (+ 1 2) (/ 8 4)); (* (car (2 4 (+ 2 4) 8)) (/ 27 9)); (+ (car (2 3 4)) (car (cdr (cdr (9 8 7 6))))); 

1. Write a "left-most" derivation for (* (car (2 4 (+ 2 4) 8)) (/ 27 9));
2. Draw the parse tree for (* (car (2 4 (+ 2 4) 8)) (/ 27 9));