1) How does Boolean algebra capture the essential properties of logic operations and set operations?
2) How does the reduction of Boolean expressions to simpler forms resemble the traversal of a tree, from the Week Four material? What sort of Boolean expression would you end up with at the root of the tree?
3) Conjunctive and disjunctive normal forms provide a form
of balanced expression. How might this be important in terms of the efficiency of computational evaluation?