The Boolean expression ( p ∧ q ) ⇒ ( (r ∧ q) ∧ p) is equivalent to:

$( p ∧ q ) ⇒ ( ( r ∧ q ) ∧ p ) ≡ ( p ∧ q ) ⇒ ( r ∧ ( p ∧ q ) ) \ldots \ldots . ( i )$

Case: $I$ when $p ∧ q = T$ and $r = F$

Statement$- ( i )$ is false as well as option $( 3 )$ is also false
option $( 1 ) ,$ option $( 2 )$ are True so given expression is not equivalent to option $( 1 )$, option $( 2 )$

option $( 4 )$ may be true if we consider $q = T ∴$ option $( 4 )$ is also not equivalent to option $( 1 )$ Case : $II$ $p ∧ q =$False