Based on the above answer the following:
(i) How many relations can be there from S to J? (1 mark)
(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. (1 mark)
(iii)(a) How many one-one functions can be there from set S to set J? (2 marks)
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. (2 marks)