Tessellate S.T.E.M.S. (2019) - Computer Science - College - Set 3 - Objective Problem 3

Suppose $\sigma$ is a first-order language with a finite number of relation symbols and no function symbols.

Suppose the maximum arity of a relation symbol in $\sigma$ is $n$ . Which of the following could be values of $n$ so that the following statement is true?

If $\Phi$ is an arbitrary sentence over $\sigma$ , $\Phi$ admits a finite model.

This problem is a part of Tessellate S.T.E.M.S (2019)