Write a Scala program that simplifies boolean expressions as in assignment 2, except:
* Results are reported in a Normal Form (i.e., a list of terms, each joined by ands, or vice versa). For example, lisp `(or a (and b c))` should be reported as the list with elements `(a or b) (a or c)`
* Rather than using a binding list, prompt the user for bindings
