1. The Job sequencing problem states as follows:

• There are ‘n’ jobs to be processed on a machine.
• Each job ‘i’ has a deadline di ≥ 0 and profit pi ≥ 0.
• Profit is earned if & only if the job is completed by its deadline.
• The job is completed if …