Five jobs must be processed in a three-machine flowshop layout. The company wants to minimize the makespan. In total, three operations must be completed (one operation per machine) and the machine routing should be C-A-B for all jobs. Please select different integer processing times for each of the jobs from the interval [1,20] such that the machine routing will be C-A-B for all jobs and the middle machine (Machine A) is dominated. Before solving the question, fill in the following table and copy it into your answer sheet. Otherwise, the solution cannot be evaluated. a) Solve the problem optimally and report the optimal job sequence(s). Show your steps properly. b) Draw the Gantt chart, based on the optimal job sequence (or based on one randomly selected optimal job sequence if there are alternative optimal solutions) in part (a). c) Suppose that the due dates of the jobs are dl=15,d2=20,d3=12,d4=27,d5=18. If the company receives a reward of $5 for each early job and a penalty of $10 for each tardy job, compute total net yield, based on the optimal job sequence that you use in part (b)