Assume that agents, objects, and preferences are as shown below. Is it possible for serial dictatorship to produce the allocation 1C, 2D, 3B, 4A? If yes, write an order which results in this allocation (your answer should consist of four numbers, so 1342 indicates that agent 1 chooses first, 3 second, 4 third, and 2 fourth) Agent 1: A > B > C > D Agent 2: A > D > C > B Agent 3: B > C > D > A Agent 4: B > A > D > C

I’m meeting help with part C of this problem which is finding a recursive solution. The first picture shows you the problem and the second picture is the recursive solution that I have developed which is not working. Any help would be appreciated.

Q1 Dan has a list of problems suitable for the assignment. The difficulties of these problems are stored in a list of integers a. The i-th problem’s difficulty is represented by a[i] (the higher the integer, the more difficult the problem). Dan is too busy eating saltines to worry about assignment decisions, so he asks Michael to select at least two problems from the list for the assignment. Since there are many possible subsets of the problems to consider and Michael has a life, he decides to consider only sublists (definition follows) of the list of problems. To make grading the assignment easier, Michael wants to pick problems that don’t vary too much in difficulty. What is the smallest difference between the difficulties of the most difficult selected problem and the least difficult selected problem he can achieve by selecting a sublist of length at least 2 of the original list of problems? Definition: A sublist of a list a is any list you can obtain by removing some (possibly 0)…