$R$ is a binary predicate. So, we can write it as $R(x, y)$.
$$
R=\{\langle 3,2\rangle,\langle 4,3\rangle,\langle 3,1\rangle,\langle 4,2\rangle,\langle 2,1\rangle,\langle 4,1\rangle\}
$$
It means $R(3,2)=$ True ; $R(2,3)=$ False. $R(4,3)=$ True. $R(3,3)=$ False.
Similarly, since P, Q are unary predicate, so:
$$
\begin{aligned}
P & =\{\langle 1\rangle,\langle 3\rangle\} \\
Q & =\{\langle 2\rangle,\langle 4\rangle\}
\end{aligned}
$$
It means $\mathrm{P}(1)=$ True, $\mathrm{P}(2)=$ False, $\mathrm{P}(3)=$ True, $\mathrm{P}(4)=$ False.
Also, $\mathrm{Q}(2)=$ True, $\mathrm{Q}(1)=$ False, $\mathrm{Q}(4)=$ True, $\mathrm{Q}(3)=$ False.
$$
\exists x( P(x) \wedge Q(x))
$$
A is False. There is No element in the domain for which both P and Q are true.
$$
\exists x ( P(x) \rightarrow Q(x))
$$
$B$ is True. For element 2 in the domain, $\mathrm{P}(2) \rightarrow \mathrm{Q}(2)$ is true.
$$
\forall x ( P(x) \rightarrow \exists y (R(x, y)))
$$
C is false. Counterexample is $\mathrm{x}=1$.
$$
\forall x (Q(x) \rightarrow \exists y R(x, y)))
$$
$D$ is true.
