State T for true and F for false
(i) Let R = {(3,1), (1,3), (3,3)} be a relation defined on the set A = {1, 2, 3}. Then R is symmetric, transitive but not reflexive.
(ii) If A = {0, 1} and N be the set of natural numbers. Then, the mapping f : N → A defined by f(2n - 1) = 0, f(2n) = 1, ∀nϵN, is onto
(iii) The relation R on the set A = {1, 2, 3} defined as R = {(1, 1), (1, 2), (2, 1), (3, 3)} is reflexive, symmetric and transitive.
(iv) A binary operation on a set has always the identity element.