Let and . Then the total number of one-one maps , such that , is :
Let the sets be and .
We seek one-one maps such that .
Considering ordered pairs from B that sum to 14, we have , but is not allowed under a one-one mapping, so the valid pairs are and .
Each of these pairs yields two assignments for and , namely for the options or , and for the options or , giving 4 total assignments.
Since pairs like and are invalid because 9 and 6 are not in B, there are no further assignments for and beyond these four.
For each of these assignments, the remaining three elements of A must be mapped one-to-one to any three of the remaining five elements of B. The number of such mappings is .
Therefore, the total number of one-one maps satisfying the condition is .
The correct answer is Option (2): 240.
Tagged One-one, onto functions and counting functions. Machine-assigned, so read it as a strong shortlist rather than a verdict.