classtimes it is available. Each instructor I has given an ordering of their preferred classtimes, T111...T1,m, from best to worst. We need to assign each course a distinct class time. If instructor I is assigned the time TLK, we say the instructor has unhappiness K. We want to nd an assignment that minimizes the maximum unhappiness of an instructor. Give an efcient algorithm for this problem. (Hint: Consider the related problem, \"Is there an assignment with unhappiness at most K?\