By considering examples, find a general pattern that will tell you how many different one-to-onecorrespondences you can list for a set having n elements.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.