Let $\mathcal{L}$ be a first-order language with a single binary relation symbol $R$. Let $\psi$ be the first-order sentence: $\forall x \neg R(x, x) \land \forall x \forall y \forall z (R(x, y) \land R(y, z) \implies R(x, z)) \land \forall x \exists y R(x, y)$ Which of the following structures is a model of $\psi$?