A job shop has five jobs that must be processed on a single machine. The due date and processing time for each job are given in the table. Use dynamic programming to determine the order in which the jobs should be done so as to minimize the total lateness of the jobs. (The lateness of a job is simply how long after the job's due date the job is completed) Job 1 2 3 4 5 Processing Time (Days) 2 4 6 8 5 Due Date (Days from now) 4 12 18 12 15