The university has hired you to write an algorithm to schedule their final exams. each quarter, the university offers n different classes. there are r different rooms on campus and t different time slots in which exams can be offered. you are given two arrays e[1..n] and s[1..r] where e[i] is the number of students enrolled in the ith class, and s[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.

a. write an algorithm to assign a room and a time slot to each class (or report correctly that no such assignment is possible).
b. provide time complexity analysis.
c. explain why your algorithm is correct.

When you type the pwd command, you notice that your current location on the linux filesystem is the /usr/local directory. answer the following questions, assuming that your current directory is /usr/local for each question. a. which command could you use to change to the /usr directory using an absolute pathname? b. which command could you use to change to the /usr directory using a relative pathname? c. which command could you use to change to the /usr/local/share/info directory using an absolute pathname? d. which command could you use to change to the /usr/local/share/info directory using a relative pathname? e. which command could you use to change to the /etc directory using an absolute pathname? f. which command could you use to change to the /etc directory using a relative pathname?