3. (1 point) Recall the Job Scheduling problem that was discussed in class. In this problem n jobs are given each with a duration and a deadline and the goal is to minimize the maximum lateness. Consider a variant of this problem where the goal is to minimize the sum of lateness of all jobs. That is, find a schedule such that the sum of lateness of jobs as per this schedule is minimized. Answer the next question: Prove or disprove: The greedy algorithm that we discussed in class for the Job Scheduling problem also works for above variant of the problem. 3. (1 point) Recall the Job Scheduling problem that was discussed in class. In this problem n jobs are given each with a duration and a deadline and the goal is to minimize the maximum lateness. Consider a variant of this problem where the goal is to minimize the sum of lateness of all jobs. That is, find a schedule such that the sum of lateness of jobs as per this schedule is minimized. Answer the next question: Prove or disprove: The greedy algorithm that we discussed in class for the Job Scheduling problem also works for above variant of the