Consider the following two binary relations on the set $A = {a, b, c}$: $R_1 = {(c, a), (b, b), (a, c), (c, c), (b, c), (a, a)}$ and $R_2 = {(a, b), (b, a), (c, c), (c, a), (a, a), (b, b), (a, c)}$. Then:

4 Let $A=\{1,2,3\}$. The number of relations on $A$, containing $(1,2)$ and $(2,3)$, which are reflexive and transitive but not symmetric, is _________.

An organization awarded $48$ medals in event 'A', $25$ in event 'B' and $18$ in event 'C'. If these medals went to total $60$ men and only five men got medals in all the three events, then, how many received medals in exactly two of three events?

Let $A = {1, 2, 3, ..., 100}$ and $R$ be a relation on $A$ such that $R = {(a, b) : a = 2b + 1}$. Let $(a_1, a_2), (a_2, a_3), (a_3, a_4), ..., (a_k, a_{k+1})$ be a sequence of $k$ elements of $R$ such that the second entry of an ordered pair is equal to the first entry of the next ordered pair. Then the largest integer k , for which such a sequence exists, is equal to :

Let the relations $R_1$ and $R_2$ on the set $X = \{1, 2, 3, ..., 20\}$ be given by $R_1 = \{(x, y) : 2x - 3y = 2\}$ and $R_2 = \{(x, y) : -5x + 4y = 0\}$. If $M$ and $N$ be the minimum number of elements required to be added in $R_1$ and $R_2$, respectively, in order to make the relations symmetric, then $M + N$ equals