write a program that will decide whether a function is one to one, onto, and bijective. The input to the program is a file containing a function. The output of the program is a file containing the three decisions about the function. The input file contains the size of the domain, the elements in the domain, the size of the codomain, the elements in the codomain, the number of mappings in the function, and the list of mappings. The elements are positive integers with no duplicates and unordered. The pairs are unordered. The program asks the user for file names

5 10 12 23 19 > one to one not onto not bijective

8 80 15 20 29 10 45 50 30

5 12 45 19 30 10 80 23 10 15 29

Run your program with the given functions and decide whether they are one to one, onto, and bijective