Recall from class that we showed not and Lambda can be used to express the other Boolean functions. For example, A V B is logically equivalent to not(not A Lambda not B). Since not and Lambda can be used to write all the other functions, we say the set {not, Lambda} is Universal. Lei be a new Boolean function, defined by the following truth table: (a) Using just and the proposition A, find an expression logically equivalent to not A. Demonstrate this logical equivalence with a truth table. (b) Using just and the propositions A, B, find an expression logically equivalent to A Lambda B. Demonstrate this logical equivalence with a truth table. (c) Is the set {} Universal? Provide a short justification for your