User talk:Pallavi32001

hello ppl!!!! can anyoone please give me the solution of this program

follows: 1) Define three sets A, B and C each contain integers with cardinalities |A| = |B| < |C| ≤ 20. (Notice that the cardinality of the set C should be greater than the cardinality of B, and that the cardinalities of A and B should be equal). 2) Function f should be a one-to-one correspondence f: A → B. 3) Function g should be a one-to-one (but not onto) function g: A → C. 4) Function h should be a not one-to-one function h: B → C. The program must incorporate the functions f, g, and h of the types indicated above. The actual functions (mappings) are the student’s choice. 2. Program operation. 1) The program must first display the contents of the sets A, B, and C. 2) For each of the functions f, g, and h, the program must do the following: a) Prompt the user to enter (type in) an element of the domain of the function. b) Display the ordered pair that contains the image under the corresponding function of the element entered by the user. c) Prompt the user to enter an element of the codomain of the function. d) Display the ordered pair that contains the pre-image under the corresponding function of the element of the codomain entered by the user. e) In the case of function f, the program should also display the image of the composition of g and f, that is, the image of ))()((xfgxfg=o. In each case, the program should display a message when the required image or pre-image does not exist under a given function (f, g, or h, or ). Each of the above prompts and displays should be done several times for each type of function. ))((xfgo The program must clearly indicate the type of functions considered in each case and provide all the necessary output in an understandable manner. 2. The results Run your program at least three times showing different situations or scenarios, including cases in which the image, or pre-image of the function does not exist.