A school is organizing a debate competition with participants as speakers $S = \{S_1, S_2, S_3, S_4\}$ and these are judged by judges $J = \{J_1, J_2, J_3\}$. Each speaker can be assigned one judge. Let $R$ be a relation from set $S$ to $J$ defined as $R = \{(x, y) : \text{speaker } x \text{ is judged by judge } y, x \in S, y \in J\}$. Based on the above, answer the following : (i) How many relations can be there from $S$ to $J$ ? (ii) A student identifies a function from $S$ to $J$ as $f = \{(S_1, J_1), (S_2, J_2), (S_3, J_2), (S_4, J_3)\}$ Check if it is bijective. (iii) (a) How many one-one functions can be there from set $S$ to set $J$ ? OR (iii) (b) Another student considers a relation $R_1 = \{(S_1, S_2), (S_2, S_4)\}$ in set $S$. Write minimum ordered pairs to be included in $R_1$ so that $R_1$ is reflexive but not symmetric.