Surjective, Injective, Bijective, or Nothing? Given a mapping from the integers from 1 to N to the integers from 1 to N, determine if the mapping is surjective, injective, bijective, or nothing.
You may choose any character/digit for the four outputs.
Specs
Input format: n, arrays of pairs (n is the highest number in the domain and range)
For example, if the first number is 3, then both the domain and the co-domain are {1,2,3}.
For example, {i+1 | i from 1 to 9} (n=10) is represented by 10, [[1,2],[2,3],...,[9,10]].
The input may contain duplicate.
Testcases
2, [[1,2],[2,1]] =&gt; bijective
2, [[1,1],[1,2]] =&gt; surjective
3, [[1,1]] =&gt; injective
3, [[1,2],[2,3]] =&gt; injective
4, [[1,2],[2,2],[3,2],[4,2]] =&gt; nothing
2, [[1,2],[1,2]] =&gt; injective
3, [[1,1],[1,2],[1,3]] =&gt; surjective
2, [[1,1],[1,1],[2,2]] =&gt; bijective
Pyth - 10 9 13 bytes
im&amp;{IdqSQSdE2

Takes domain and codomain separately as allowed by comments in OP.
Test Suite.