1.Let F1(A,B,C)=(A∧¬B)∨[¬C∧(A∨B)]∨¬AF_1(A,B,C) = (A \land \neg B) \lor [\neg C \land (A \lor B)] \lor \neg AF1(A,B,C)=(A∧¬B)∨[¬C∧(A∨B)]∨¬A and F2(A,B)=(A∨B)∨(B→¬A)F_2(A,B) = (A \lor B) \lor (B \rightarrow \neg A)F2(A,B)=(A∨B)∨(B→¬A) be two logical expressions. Then:a.F1F_1F1 is a tautology but F2F_2F2 is not a tautologyb.F1F_1F1 is not a tautology but F2F_2F2 is a tautologyc.Both F1F_1F1 and F2F_2F2 are not tautologiesd.F1F_1F1 and F2F_2F2 both are tautologiesLogin to continueOnly logged in users canattempt or see the solution.
