Need to write a prolog program:
Your program should read two logical expressions and determine their equivalence using
a truth table. You need first to construct the equivalent binary expression (parse) tree for
each expression. To make this easy, you may assume that the expression will be given
directly in the “unique” postfix notation, with all operators are strictly unary (the not
operator) or binary (and, or, imply).
(So “x y z and” is not allowed, instead we may have: “x y and z and”).
Example: “x and y imply x or z” will be encoded as:
“x y and x z or imply”