Four jobs must be processed on a single machine and the first job that will be processed must be job 4. The time required to perform each job, the due date, and the penalty (in dollars) per day the job is late are given in the table below. Use the branch-and-bound method for machine scheduling that we have covered in the lecture to determine the order of performing the jobs that will minimize the total penalty costs due to delayed jobs. Use jumptracking approach. Jobs Process Time (days) | Penalty (S/day) Due Date End of day 14 End of day 13 End of day 10 End of day 13 6 6 7 6 Four jobs must be processed on a single machine and the first job that will be processed must be job 4. The time required to perform each job, the due date, and the penalty (in dollars) per day the job is late are given in the table below. Use the branch-and-bound method for machine scheduling that we have covered in the lecture to determine the order of performing the jobs that will minimize the total penalty costs due to delayed jobs. Use jumptracking approach. Jobs Process Time (days) | Penalty (S/day) Due Date End of day 14 End of day 13 End of day 10 End of day 13 6 6 7 6