Give a dynamic programming algorithm for 1|| w_jU_j in which the jobs have a common deadline in which you fill in a table f(j,w), where f(j,w) is the minimum deadline d by which you can schedule a subset of jobs 1..j and have that the weight of the jobs finishing by time d is at least w. Be sure to give the recurrence and justify why it is correct.

(Based on the concepts from Scheduling: Theory, Algorithms and Systems. Chapter 3)