Below is an algorithm for sequencing jobs with a delivery date. CONSIDERATIONS There is a list of jobs that must be completed. Each job has a processing time, a defined delivery date and an associated profit. Profit from each job is earned only when the job is delivered on or before its delivery date. A single processor is available to process all jobs. ALGORITHM Sort all jobs in ascending order of their delivery date, in cases where more than one job has the same delivery date, sort them in ascending order of their job number. Get the value of the largest delivery date $($the one for the job that is due later$).$ Create a Gantt chart where the time on the chart starts at zero and the maximum time is the value you obtained in the previous step. Select one job at a time. Arrange that work on the Gantt chart that has available space, as far away in time from $0$ but ensuring that the work is completed before its due date. Return to step $4$ to select the next job, until all are completed. IMPORTANT NOTE: To answe