1. Using the following rewrite rules for Boolean expressions, give a derivation for the Boolean expression (NOT((F AND T)) OR F). Also draw a derivation tree corresponding to the derivation.

bool-exp	T |
	F |
	NOT ( bool-exp ) |
	( bool-exp AND bool-exp ) |
	( bool-exp OR bool-exp )

2. 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 |
	F |
	NOT ( bool-exp ) |
	bool-exp AND bool-exp |
	bool-exp OR bool-exp