consider a new office building with n floors and k offices per floor in which you must assign 2nk people to work, each sharing an office with exactly one other person. find a closed form solution for the number of ways there are to assign offices if from floor to floor the offices are distinguishable but any two offices on a given floor are not.