Please help me find the solution for the below problem

PROBLEM 2 Ten kids line up for recess. The names of the kids are: {Alex, Bobby, Cathy, Dave, Emy, Frank, George, Homa, Ian, Jim }. Let S be the set of all possible ways to line up the kids. For example, one order might be: (Frank, George, Homa, Jim, Alex, Dave, Cathy, Emy, Ian, Bobby) The names are listed in order from left to right, so Frank is at the front of the line and Bobby is at the end of the line. Let T' be the set of all possible ways to line up the kids in which George is ahead of Dave in the line. Note that George does not have to be immediately ahead of Dave. For example, the ordering shown above is an element in T. Now define a function f whose domain is S and whose target is 7. Let r be an element of S, so x is one possible way to order the kids. If George is ahead of Dave in the ordering a, then f(x) = r. If Dave is ahead of George in r, then /(x) is the ordering that is the same as a, except that Dave and George have swapped places. (a) What is the output of f on the following input? (Frank, George, Homa, Jim, Alex, Dave, Cathy, Emy, Ian, Bobby) (b) What is the output of f on the following input? (Emy, Ian, Dave, Homa, Jim, Alex, Bobby, Frank, George, Cathy) (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 3628800 ways to line up the 10 kids with no restrictions on who comes before whom. That is, |S| = 3628800. Use this fact and the answer to the previous question to determine |7|