We are given F1(A,B,C)=(A∧∼B)∨[∼C∧(A∨B)]∨∼A and F2(A,B)=(A∨B)∨(B→∼A).
First, we check whether F1 is a tautology. Consider A=T, B=T, C=T: (T∧F)∨[F∧(T∨T)]∨F=F∨F∨F=F. Since F1 evaluates to F for this assignment, F1 is not a tautology.
Next, we check F2. Recall that B→∼A≡∼B∨∼A. So F2=(A∨B)∨(∼B∨∼A)=(A∨∼A)∨(B∨∼B)=T∨T=T.
More explicitly, rearranging: F2=A∨B∨∼B∨∼A=(A∨∼A)∨(B∨∼B)=T. So F2 is always true, making it a tautology.
Therefore F1 is not a tautology but F2 is a tautology.