The University of Northern Florida has hired you to write an algorithm to schedule their final exams. Each semester, the university offers n different classes. There are r different rooms on campus and k different time slots in which exams can be offered. You are given two arrays E[1 .. n] and C[1 .. r], where E[i] is the number of students enrolled in the ith class, and C[j] is the number of seats in the jth room. At most one final exam can be held in each room during each time slot. Class i can hold its final exam in room j only if E[i] < C[j]. Describe and analyze an efficient algorithm to assign a room-time slot pair to each class (or report correctly that no such assignment is possible).