3. Using the following rewrite rules for Boolean expressions, find two different derivation trees for the Boolean expression NOT(T OR T AND F) bool-exp T NOT ( bool-exp ) | bool-exp AND bool-exp bool-exp OR bool-exp 4. Using the following rewrite rules for arithmetic expressions, draw a derivation tree for the expression 5*3+1+4 expr expr add-op term \ term term term mult-op factor \factor factor expr ) \ digit-seq add-op +1. mult-op *| DIVI MOD digit-seq digit digit-seq \ digit digit e12314151617189 5. Using the following rewrite rules for arithmetic expressions, draw a derivation tree for the expression 5*3+1+4 expr term { add-op term ter n factor{ mult-op factor factor ( expr ) \ digit-seq add-op --+- mult-op *I DIV MOD digit-seq digit digit-se digit digit e|1213141516171819 Note: A pair of new special symbols (' and }') is used in the rewrite rules above. The meaning of is that the string of nonterminal and terminal symbols appearing between and \ can be repeated 0 or more times. Fo instance, the first rewrite rule expr term { add-op term } is equivalent to the following (infinite) set of rewrite rules expr term ! term add-op term tem add-op term add-op tem terrn add-op term add-op term add-op tem