This is dynamic programming question:

You have a set of n jobs to process on a machine. Each job j has a processing time t,, a profit pj and a deadline dj. The machine can process only one job at a time, and job j must run uninterruptedly for tj consecutive units of time. If job j is completed by its deadline d,, you receive a profit pj, otherwise a profit of 0. You can assume that all parameters are integers, and that the jobs are sorted in increasing order of deadline. Give a dynamic programming algorithm to the problem of determining the schedule that gives the maximum ullonul of profit. nalvve ihe i.im( . and spact,4%n plexity of your solution