Problem 2: (5 points) Scheduling jobs with penalties: For each 1s i s n job ji is given by two numbers di and pi, where da is the deadline and pi is the penalty. The length of each job is equal to 1 minute and once the job starts it cannot be stopped until completed. We want to schedule all jobs, but only one job can run at any given time. If job i does not complete on or before its deadline, we will pay its penalty pi. Design a greedy algorithm to find a schedule such that all jobs are completed and the sum of all algorithm