Question no. 6, please.

Asan C or Log C+ Pro Rep Rep You C Cor Cor Mic de SOU RO E A in CO CT CG CZ learn-us-east-1-prod-fleet01-xythos.s3.us-east-1.amazonaws.com/5cc71db6522fe/10899529?response-content-dispositioninline%3B%20filename%2A%3DUTF-8... + K e p p is always false; thus, p np is unsatisfiable. To show that a compound proposition is satisfiable, we need to find at least one assignment of truth values to its variables that makes it true. However, to show that a compound proposition is unsatisfiable, we need to show that every assignment of truth values to its variables makes it false. 6. (10 pt., 2.5 pt. each) Determine whether each of the following compound propositions is satisfiable or unsatisfiable. Justify your answer. a. (p = q)^(p = q) (p -9)^(p-2)^(-p ~ -9) c. (p V-2)^(-pvq)^(qvr)(qv-r)^(-9V-r) d. (pvq)^(pv )^(-p vq)^(-p V-)