Assertion (A) : Let \(\mathbb{Z}\) be the set of integers. A function \(f: \mathbb{Z} \to \mathbb{Z}\) defined as \(f(x)=3x-5, \forall x \in \mathbb{Z}\) is a bijective function.
Reason (R) : A function is a bijective function if it is both surjective and injective.