Ten kids line up for recess. the names of the kids are: {abe, ben, cam, don, eli, fran, gene, hal, ike, jan}. let s be the set of all possible ways to line up the kids. for example, one ordering might be: (fran, gene, hal, jan, abe, don, cam, eli, ike, ben) the names are listed in order from left to right, so fran is at the front of the line and ben is at the end of the line. let t be the set of all possible ways to line up the kids in which gene is ahead of don in the line. note that gene does not have to be immediately ahead of don. for example, the ordering shown above is an element in t. now define a function f whose domain is s and whose target is t. let x be an element of s, so x is one possible way to order the kids. if gene is ahead of don in the ordering x, then f(x) = x. if don is ahead of gene in x, then f(x) is the ordering that is the same as x, except that don and gene have swapped places. (a)what is the output of f on the following input? (fran, gene, hal, jan, abe, don, cam, eli, ike, ben) (b)what is the output of f on the following input? (eli, ike, don, hal, jan, abe, ben, fran, gene, cam) (c)is the function f a k-to-1 correspondence for some positive integer k? if so, for what value of k? justify your answer. (d)there are 362880 ways to line up the 10 kids with no restrictions on who comes before whom. that is, |s| = 362880. use this fact and the answer to the previous question to determine |t|.