Q.Write the dual of $p \wedge \sim p \equiv F$

Using t and c for tautology and contradiction, two statement patterns built only from the connectives ∧ and ∨ (together possibly with t and c) are called duals of each other if each can be obtained from the other by simultaneously swapping every ∨ with ∧, every ∧ with ∨, every t with c, and every c with t, while leaving every statement letter and every negation exactly as it is. For instance the dual of p ∨ q is p ∧ q, the dual of t ∨ p is c ∧ p, …