in the question given that 3 equivalence classes.
So, we need to divide the given set into 3 partitions.
Here asking the cardinality of R, cardinality of R is a integer. It doesn't have any relation with what are those elements in R.
i mean to say, let R1={(1,2),(1,3)} R2={(5,7),(9,11)} both are different relations but their cardinalities are equal. So, elements are not matters in the partition only no.of elements in a partition is matter.
if one partition have n elements, then it contributes n$^2$ elements in the relation. why ? ( think about it )
there are 7 elements in set, you need three partitions which make relation R cardinality maximum.
it's same as, 7 vertices, 3 components maximum number of edges possible (be aware of directed graph instead of undirected graph)
My intention is not to answer your question, just giving some basic knowledge how to solve your question.