Let\( Δ,▽∈{∧,∨} \)be such that \(p▽q⇒((pΔq)▽r) \)is a tautology. Then \((p▽q)Δr \)is logically equivalent to:
The statement \((∼(p ⇔∼q))∧q \)is :