Below is a proof showing that two logical expressions are logically equivalent. Select all the laws that are used for the proof below: Predicates P and Q are defined below. The domain of discourse is the set of all positive integers. P(x): x is prime Q(x): x is a perfect square (ie., x = y2, for some integer y) Indicate whether each logical expression is a proposition. If the expression is a proposition, then give its truth value. Forall x Q(x) Lambda P(3) a) Proposition: False b) Proposition: True c) Not proposition