1.Consider the following two propositions:P1:¬(p∧q)P_1: \neg(p \wedge q)P1:¬(p∧q)P2:(p∧q)↔((¬p)∨q)P_2: (p \wedge q) \leftrightarrow ((\neg p) \vee q)P2:(p∧q)↔((¬p)∨q)If the proposition p→((¬p)∨q)p \rightarrow ((\neg p) \vee q)p→((¬p)∨q) is evaluated as FALSE, then:a.P1P_1P1 is TRUE and P2P_2P2 is FALSEb.P1P_1P1 is FALSE and P2P_2P2 is TRUEc.Both P1P_1P1 and P2P_2P2 are FALSEd.Both P1P_1P1 and P2P_2P2 are TRUELogin to continueOnly logged in users canattempt or see the solution.
