6. Let J be a set of n jobs. Each job ji takes unit time to complete and must be finished by time di. If it is not finished by its deadline, job i incurs a penality of wi. We want to find a schedule for J that minimizes the total penaly incurred for missed deadlines A student proposes a greedy algorithm that schedules the jobs in order of non-decreasing deadlines. (Remember each jobs takes unit time.) (a) Trace this approach when applied to the following instance of the problem: 1 2 3 4 5 6 7 wi 70 60 50 40 30 20 10 (b) Does this greedy approach find the optimal schedule for this example (i.e. the schedule that incurs the miminum penalty for missed deadlines)? (c) Do you think it will always find the best solution? A cogent argument is sufficient to establish your claim