Aset j of jobs are to be scheduled on m identical machines. each job j 2 j has a processing requirement pj (denoting the number of machine days required to complete the job), a release date rj (representing the beginning of the day when job j becomes available for processing), and a due date dj rj + pj (representing the beginning of the day by which the job must be completed). we assume that a machine can work on only one job at a time and that each job can be processed by at most one machine at a time. however, we allow preemptions (i. e., we can interrupt a job and process it on di§erent machines on di§erent days). the scheduling problem is to determine a feasible schedule that completes all jobs before their due dates or to show that no such schedule exists. formulate this problem as a maximum áow problem.

1. ask the user how many questions are in the quiz. 2. ask the user to enter the key (that is, the correct answers). there should be one answer for each question in the quiz, and each answer should be an integer. e.g., 34 7 13 100 81 3 9 10 321 12 might be the key for a 10-question quiz. you will need to store the key in an array. 3. ask the user to enter the answers for the quiz to be graded. there needs to be one answer for each question. note that these answers do not need to be stored; each answer can simply be compared to the key as it is entered. 4. when the user has entered all of the answers to be graded, print the number correct and the percent correct. 5. add a loop so that the user can grade any number of quizzes with a single key. after the results have been printed for each quiz, ask "grade another quiz? (y/n)." note: you only have one array (the key). you are not creating a new key for each set of quiz answers.